Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …011000100110011100001111 |
3 | 111020121201100010120220212021 |
4 | 112331301220120212130033 |
5 | 101214310002231241421 |
6 | 554451434322151011 |
7 | 30163111504322614 |
oct | 2675615030463417 |
9 | 436551303526767 |
10 | 101002202212111 |
11 | 2a200880032682 |
12 | b3b2aa11b2467 |
13 | 444860b738c75 |
14 | 1ad276591050b |
15 | ba247453d341 |
hex | 5bdc6862670f |
101002202212111 has 2 divisors, whose sum is σ = 101002202212112. Its totient is φ = 101002202212110.
The previous prime is 101002202212063. The next prime is 101002202212123. The reversal of 101002202212111 is 111212202200101.
It is a strong prime.
It is an emirp because it is prime and its reverse (111212202200101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101002202212111 - 27 = 101002202211983 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101002202212511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501101106055 + 50501101106056.
It is an arithmetic number, because the mean of its divisors is an integer number (50501101106056).
Almost surely, 2101002202212111 is an apocalyptic number.
101002202212111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002202212111 is an equidigital number, since it uses as much as digits as its factorization.
101002202212111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101002202212111 its reverse (111212202200101), we get a palindrome (212214404412212).
The spelling of 101002202212111 in words is "one hundred one trillion, two billion, two hundred two million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •