Base | Representation |
---|---|
bin | 11110100101101111100… |
… | …101000101011000111001 |
3 | 21102221220201201002222110 |
4 | 132211233211011120321 |
5 | 233420110404000441 |
6 | 4245410234042533 |
7 | 304605161453616 |
oct | 36455745053071 |
9 | 7387821632873 |
10 | 2102111000121 |
11 | 740555948590 |
12 | 29b4a0879449 |
13 | 1232c75137c2 |
14 | 73a5802150d |
15 | 39a32703b16 |
hex | 1e96f945639 |
2102111000121 has 96 divisors (see below), whose sum is σ = 3249353318400. Its totient is φ = 1198627372800.
The previous prime is 2102111000107. The next prime is 2102111000137. The reversal of 2102111000121 is 1210001112012.
It is not a de Polignac number, because 2102111000121 - 26 = 2102111000057 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2102111000097 and 2102111000106.
It is not an unprimeable number, because it can be changed into a prime (2102111070121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1591302141 + ... + 1591303461.
It is an arithmetic number, because the mean of its divisors is an integer number (33847430400).
Almost surely, 22102111000121 is an apocalyptic number.
It is an amenable number.
2102111000121 is a deficient number, since it is larger than the sum of its proper divisors (1147242318279).
2102111000121 is a wasteful number, since it uses less digits than its factorization.
2102111000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2195 (or 2176 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2102111000121 its reverse (1210001112012), we get a palindrome (3312112112133).
The spelling of 2102111000121 in words is "two trillion, one hundred two billion, one hundred eleven million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •