Base | Representation |
---|---|
bin | 10010101110010000… |
… | …000011001010001100 |
3 | 1220220000221001200120 |
4 | 102232100003022030 |
5 | 312132421441022 |
6 | 13122455424540 |
7 | 1311115222050 |
oct | 225620031214 |
9 | 56800831616 |
10 | 20103312012 |
11 | 8586882953 |
12 | 3a90685150 |
13 | 1b84c0aac4 |
14 | d89cd9c60 |
15 | 7c9d76d5c |
hex | 4ae40328c |
20103312012 has 192 divisors, whose sum is σ = 58193608704. Its totient is φ = 5277000960.
The previous prime is 20103312001. The next prime is 20103312041. The reversal of 20103312012 is 21021330102.
It is a junction number, because it is equal to n+sod(n) for n = 20103311982 and 20103312000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5065653 + ... + 5069619.
It is an arithmetic number, because the mean of its divisors is an integer number (303091712).
Almost surely, 220103312012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20103312012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29096804352).
20103312012 is an abundant number, since it is smaller than the sum of its proper divisors (38090296692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20103312012 is a wasteful number, since it uses less digits than its factorization.
20103312012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4108 (or 4106 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20103312012 its reverse (21021330102), we get a palindrome (41124642114).
The spelling of 20103312012 in words is "twenty billion, one hundred three million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •