Base | Representation |
---|---|
bin | 11110110111010110000… |
… | …110110111111011101000 |
3 | 21111202200220101202000020 |
4 | 132313112012313323220 |
5 | 234222312304044422 |
6 | 4302213510440440 |
7 | 306144426026301 |
oct | 36672606677350 |
9 | 7452626352006 |
10 | 2121011003112 |
11 | 748574464571 |
12 | 2a3096363120 |
13 | 12501a03bc21 |
14 | 7492c1a97a8 |
15 | 3a28bad995c |
hex | 1edd61b7ee8 |
2121011003112 has 16 divisors (see below), whose sum is σ = 5302527507840. Its totient is φ = 707003667696.
The previous prime is 2121011003107. The next prime is 2121011003117. The reversal of 2121011003112 is 2113001101212.
It is an interprime number because it is at equal distance from previous prime (2121011003107) and next prime (2121011003117).
It is a junction number, because it is equal to n+sod(n) for n = 2121011003091 and 2121011003100.
It is not an unprimeable number, because it can be changed into a prime (2121011003117) 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, 44187729208 + ... + 44187729255.
It is an arithmetic number, because the mean of its divisors is an integer number (331407969240).
Almost surely, 22121011003112 is an apocalyptic number.
It is an amenable number.
2121011003112 is an abundant number, since it is smaller than the sum of its proper divisors (3181516504728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2121011003112 is a wasteful number, since it uses less digits than its factorization.
2121011003112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88375458472 (or 88375458468 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2121011003112 its reverse (2113001101212), we get a palindrome (4234012104324).
The spelling of 2121011003112 in words is "two trillion, one hundred twenty-one billion, eleven million, three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •