Base | Representation |
---|---|
bin | 10111001110000011101101… |
… | …000101001110100001101111 |
3 | 111101120200110102210220001211 |
4 | 113032003231011032201233 |
5 | 101341123023210000421 |
6 | 1001105443405415251 |
7 | 30340002360515212 |
oct | 2716035505164157 |
9 | 441520412726054 |
10 | 102121120000111 |
11 | 2a5a2361a47803 |
12 | b55391056a527 |
13 | 44c9c98928824 |
14 | 1b3098d671779 |
15 | bc1610c399e1 |
hex | 5ce0ed14e86f |
102121120000111 has 32 divisors (see below), whose sum is σ = 107202710016000. Its totient is φ = 97094524843008.
The previous prime is 102121120000103. The next prime is 102121120000117. The reversal of 102121120000111 is 111000021121201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 102121120000111 - 23 = 102121120000103 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102121120000091 and 102121120000100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102121120000117) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10485786280 + ... + 10485796018.
It is an arithmetic number, because the mean of its divisors is an integer number (3350084688000).
Almost surely, 2102121120000111 is an apocalyptic number.
102121120000111 is a deficient number, since it is larger than the sum of its proper divisors (5081590015889).
102121120000111 is a wasteful number, since it uses less digits than its factorization.
102121120000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13063.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102121120000111 its reverse (111000021121201), we get a palindrome (213121141121312).
The spelling of 102121120000111 in words is "one hundred two trillion, one hundred twenty-one billion, one hundred twenty million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •