Base | Representation |
---|---|
bin | 1001101011001001101… |
… | …01001010100010111111 |
3 | 1011202222211000220111201 |
4 | 10311210311022202333 |
5 | 20421230424441343 |
6 | 412412050200331 |
7 | 33005166400351 |
oct | 4654465124277 |
9 | 1152884026451 |
10 | 332404140223 |
11 | 118a76520481 |
12 | 545095830a7 |
13 | 254652cbc8c |
14 | 121349a70d1 |
15 | 89a73ca94d |
hex | 4d64d4a8bf |
332404140223 has 8 divisors (see below), whose sum is σ = 351969876720. Its totient is φ = 312839798400.
The previous prime is 332404140191. The next prime is 332404140239. The reversal of 332404140223 is 322041404233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 332404140223 - 25 = 332404140191 is a prime.
It is a super-2 number, since 2×3324041402232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 332404140191 and 332404140200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (332404140253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 163548 + ... + 831598.
It is an arithmetic number, because the mean of its divisors is an integer number (43996234590).
Almost surely, 2332404140223 is an apocalyptic number.
332404140223 is a deficient number, since it is larger than the sum of its proper divisors (19565736497).
332404140223 is a wasteful number, since it uses less digits than its factorization.
332404140223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697337.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 332404140223 its reverse (322041404233), we get a palindrome (654445544456).
The spelling of 332404140223 in words is "three hundred thirty-two billion, four hundred four million, one hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •