Base | Representation |
---|---|
bin | 11101010001111011110… |
… | …000111001011001101000 |
3 | 21010100122011212001011112 |
4 | 131101323300321121220 |
5 | 230431311001010440 |
6 | 4140204454245452 |
7 | 265241144145362 |
oct | 35217360713150 |
9 | 7110564761145 |
10 | 2012121110120 |
11 | 706376a02270 |
12 | 285b67356888 |
13 | 117985821194 |
14 | 6d55c5d5d32 |
15 | 375171c2965 |
hex | 1d47bc39668 |
2012121110120 has 64 divisors (see below), whose sum is σ = 5012556868800. Its totient is φ = 720759790080.
The previous prime is 2012121110113. The next prime is 2012121110123. The reversal of 2012121110120 is 210111212102.
It is a junction number, because it is equal to n+sod(n) for n = 2012121110095 and 2012121110104.
It is not an unprimeable number, because it can be changed into a prime (2012121110123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34097405 + ... + 34156364.
It is an arithmetic number, because the mean of its divisors is an integer number (78321201075).
Almost surely, 22012121110120 is an apocalyptic number.
2012121110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2012121110120 is an abundant number, since it is smaller than the sum of its proper divisors (3000435758680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012121110120 is a wasteful number, since it uses less digits than its factorization.
2012121110120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68253858 (or 68253854 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2012121110120 its reverse (210111212102), we get a palindrome (2222232322222).
The spelling of 2012121110120 in words is "two trillion, twelve billion, one hundred twenty-one million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •