Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …110101101010111001001111 |
3 | 111020200102120020100210202002 |
4 | 112332002103311222321033 |
5 | 101220103141421400444 |
6 | 554503555352222515 |
7 | 30164314345462106 |
oct | 2676022365527117 |
9 | 436612506323662 |
10 | 101020111121999 |
11 | 2a208430159753 |
12 | b3b645a99aa3b |
13 | 444a203b25374 |
14 | 1ad35841c903d |
15 | ba2b71901d4e |
hex | 5be093d6ae4f |
101020111121999 has 2 divisors, whose sum is σ = 101020111122000. Its totient is φ = 101020111121998.
The previous prime is 101020111121981. The next prime is 101020111122001. The reversal of 101020111121999 is 999121111020101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101020111121999 - 212 = 101020111117903 is a prime.
It is a super-2 number, since 2×1010201111219992 (a number of 29 digits) contains 22 as substring.
Together with 101020111122001, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101020111121929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510055560999 + 50510055561000.
It is an arithmetic number, because the mean of its divisors is an integer number (50510055561000).
Almost surely, 2101020111121999 is an apocalyptic number.
101020111121999 is a deficient number, since it is larger than the sum of its proper divisors (1).
101020111121999 is an equidigital number, since it uses as much as digits as its factorization.
101020111121999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 38.
The spelling of 101020111121999 in words is "one hundred one trillion, twenty billion, one hundred eleven million, one hundred twenty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •