Base | Representation |
---|---|
bin | 10111001111001110010010… |
… | …001110100110111001100001 |
3 | 111101212100011100200000211012 |
4 | 113033032102032212321201 |
5 | 101343431024212024301 |
6 | 1001210325544230305 |
7 | 30345536004314642 |
oct | 2717162216467141 |
9 | 441770140600735 |
10 | 102201200111201 |
11 | 2a6233160a04a4 |
12 | b56733b16b395 |
13 | 45046bb52c449 |
14 | 1b347c8d016c9 |
15 | bc374b27eebb |
hex | 5cf3923a6e61 |
102201200111201 has 2 divisors, whose sum is σ = 102201200111202. Its totient is φ = 102201200111200.
The previous prime is 102201200111149. The next prime is 102201200111207. The reversal of 102201200111201 is 102111002102201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101980732299601 + 220467811600 = 10098551^2 + 469540^2 .
It is a cyclic number.
It is not a de Polignac number, because 102201200111201 - 218 = 102201199849057 is a prime.
It is a super-5 number, since 5×1022012001112015 (a number of 71 digits) contains 55555 as substring.
It is not a weakly prime, because it can be changed into another prime (102201200111207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100600055600 + 51100600055601.
It is an arithmetic number, because the mean of its divisors is an integer number (51100600055601).
Almost surely, 2102201200111201 is an apocalyptic number.
It is an amenable number.
102201200111201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102201200111201 is an equidigital number, since it uses as much as digits as its factorization.
102201200111201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102201200111201 its reverse (102111002102201), we get a palindrome (204312202213402).
The spelling of 102201200111201 in words is "one hundred two trillion, two hundred one billion, two hundred million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •