Base | Representation |
---|---|
bin | 10111001111001111001000… |
… | …100001110101001010011011 |
3 | 111101212102111211220001222211 |
4 | 113033033020201311022123 |
5 | 101343434410421320102 |
6 | 1001211000210255551 |
7 | 30345600405624232 |
oct | 2717171041651233 |
9 | 441772454801884 |
10 | 102202111120027 |
11 | 2a623743361956 |
12 | b5675542875b7 |
13 | 45048051ab919 |
14 | 1b34873cc5b19 |
15 | bc37a12337d7 |
hex | 5cf3c887529b |
102202111120027 has 2 divisors, whose sum is σ = 102202111120028. Its totient is φ = 102202111120026.
The previous prime is 102202111119967. The next prime is 102202111120049. The reversal of 102202111120027 is 720021111202201.
It is an a-pointer prime, because the next prime (102202111120049) can be obtained adding 102202111120027 to its sum of digits (22).
It is a strong prime.
It is an emirp because it is prime and its reverse (720021111202201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102202111120027 - 215 = 102202111087259 is a prime.
It is not a weakly prime, because it can be changed into another prime (102202111120097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51101055560013 + 51101055560014.
It is an arithmetic number, because the mean of its divisors is an integer number (51101055560014).
Almost surely, 2102202111120027 is an apocalyptic number.
102202111120027 is a deficient number, since it is larger than the sum of its proper divisors (1).
102202111120027 is an equidigital number, since it uses as much as digits as its factorization.
102202111120027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 102202111120027 its reverse (720021111202201), we get a palindrome (822223222322228).
The spelling of 102202111120027 in words is "one hundred two trillion, two hundred two billion, one hundred eleven million, one hundred twenty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •