Base | Representation |
---|---|
bin | 10111001110000100100001… |
… | …100110010111010100011110 |
3 | 111101120202201211202111210012 |
4 | 113032010201212113110132 |
5 | 101341131324240231420 |
6 | 1001110111042443222 |
7 | 30340033246664543 |
oct | 2716044146272436 |
9 | 441522654674705 |
10 | 102122001102110 |
11 | 2a5a2774341780 |
12 | b553b17663512 |
13 | 44ca0a9336562 |
14 | 1b30a346acbca |
15 | bc1663281dc5 |
hex | 5ce12199751e |
102122001102110 has 32 divisors (see below), whose sum is σ = 201183668687232. Its totient is φ = 37014311314080.
The previous prime is 102122001102083. The next prime is 102122001102137. The reversal of 102122001102110 is 11201100221201.
It is an interprime number because it is at equal distance from previous prime (102122001102083) and next prime (102122001102137).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1511988752 + ... + 1512056291.
It is an arithmetic number, because the mean of its divisors is an integer number (6286989646476).
Almost surely, 2102122001102110 is an apocalyptic number.
102122001102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102122001102110 is a deficient number, since it is larger than the sum of its proper divisors (99061667585122).
102122001102110 is a wasteful number, since it uses less digits than its factorization.
102122001102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3024045368.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102122001102110 its reverse (11201100221201), we get a palindrome (113323101323311).
The spelling of 102122001102110 in words is "one hundred two trillion, one hundred twenty-two billion, one million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •