Base | Representation |
---|---|
bin | 101110101111101101110… |
… | …110101111010110010100 |
3 | 102101002120212201202120102 |
4 | 232233231312233112110 |
5 | 410112323231320040 |
6 | 10455420300153232 |
7 | 451040362666241 |
oct | 56575566572624 |
9 | 12332525652512 |
10 | 3212331120020 |
11 | 1029384198960 |
12 | 43a6a3238818 |
13 | 1a3bc97893a9 |
14 | b169898a5c8 |
15 | 58860543515 |
hex | 2ebeddaf594 |
3212331120020 has 48 divisors (see below), whose sum is σ = 7360878950208. Its totient is φ = 1167847330560.
The previous prime is 3212331119983. The next prime is 3212331120041. The reversal of 3212331120020 is 200211332123.
It is a super-4 number, since 4×32123311200204 (a number of 51 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 3212331119974 and 3212331120001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 762329 + ... + 2646848.
It is an arithmetic number, because the mean of its divisors is an integer number (153351644796).
Almost surely, 23212331120020 is an apocalyptic number.
It is an amenable number.
3212331120020 is an abundant number, since it is smaller than the sum of its proper divisors (4148547830188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3212331120020 is a wasteful number, since it uses less digits than its factorization.
3212331120020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3413480 (or 3413478 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 3212331120020 its reverse (200211332123), we get a palindrome (3412542452143).
The spelling of 3212331120020 in words is "three trillion, two hundred twelve billion, three hundred thirty-one million, one hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •