Base | Representation |
---|---|
bin | 111110111001001011011… |
… | …001001111111110100100 |
3 | 120022011211202021122101021 |
4 | 332321023121033332210 |
5 | 1031302430003310040 |
6 | 13105300022340524 |
7 | 624153144635332 |
oct | 76711331177644 |
9 | 16264752248337 |
10 | 4322002010020 |
11 | 1416a50507722 |
12 | 59977188a744 |
13 | 254742001186 |
14 | 10d2865c6b52 |
15 | 7765a04324a |
hex | 3ee4b64ffa4 |
4322002010020 has 12 divisors (see below), whose sum is σ = 9076204221084. Its totient is φ = 1728800804000.
The previous prime is 4322002009973. The next prime is 4322002010023. The reversal of 4322002010020 is 200102002234.
It can be written as a sum of positive squares in 2 ways, for example, as 2750343629056 + 1571658380964 = 1658416^2 + 1253658^2 .
It is a junction number, because it is equal to n+sod(n) for n = 4322002009976 and 4322002010003.
It is not an unprimeable number, because it can be changed into a prime (4322002010023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108050050231 + ... + 108050050270.
It is an arithmetic number, because the mean of its divisors is an integer number (756350351757).
Almost surely, 24322002010020 is an apocalyptic number.
It is an amenable number.
4322002010020 is an abundant number, since it is smaller than the sum of its proper divisors (4754202211064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4322002010020 is a wasteful number, since it uses less digits than its factorization.
4322002010020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216100100510 (or 216100100508 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 4322002010020 its reverse (200102002234), we get a palindrome (4522104012254).
The spelling of 4322002010020 in words is "four trillion, three hundred twenty-two billion, two million, ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •