Base | Representation |
---|---|
bin | 11101010001111011101… |
… | …101011011011100101000 |
3 | 21010100122010010212002102 |
4 | 131101323231123130220 |
5 | 230431310232413000 |
6 | 4140204422552532 |
7 | 265241133341030 |
oct | 35217355333450 |
9 | 7110563125072 |
10 | 2012120201000 |
11 | 706376441228 |
12 | 285b66b98748 |
13 | 117985593440 |
14 | 6d55c43a8c0 |
15 | 375170933d5 |
hex | 1d47bb5b728 |
2012120201000 has 512 divisors, whose sum is σ = 6061444945920. Its totient is φ = 607647744000.
The previous prime is 2012120200999. The next prime is 2012120201081. The reversal of 2012120201000 is 1020212102.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1132312112 + ... + 1132313888.
It is an arithmetic number, because the mean of its divisors is an integer number (11838759660).
Almost surely, 22012120201000 is an apocalyptic number.
2012120201000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2012120201000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3030722472960).
2012120201000 is an abundant number, since it is smaller than the sum of its proper divisors (4049324744920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012120201000 is a wasteful number, since it uses less digits than its factorization.
2012120201000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2382 (or 2368 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2012120201000 its reverse (1020212102), we get a palindrome (2013140413102).
The spelling of 2012120201000 in words is "two trillion, twelve billion, one hundred twenty million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •