Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …101101010100000101000011 |
3 | 111101212020001201211021111122 |
4 | 113033031022231110011003 |
5 | 101343421100022413102 |
6 | 1001210010522102455 |
7 | 30345464164252361 |
oct | 2717151255240503 |
9 | 441766051737448 |
10 | 102200000201027 |
11 | 2a62285a8461a3 |
12 | b56706534aa2b |
13 | 4504559a69b21 |
14 | 1b347137d6631 |
15 | bc36cac610a2 |
hex | 5cf34ab54143 |
102200000201027 has 2 divisors, whose sum is σ = 102200000201028. Its totient is φ = 102200000201026.
The previous prime is 102200000201017. The next prime is 102200000201029. The reversal of 102200000201027 is 720102000002201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102200000201027 is a prime.
Together with 102200000201029, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 102200000200996 and 102200000201014.
It is not a weakly prime, because it can be changed into another prime (102200000201029) by changing a digit.
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 as a sum of consecutive naturals, namely, 51100000100513 + 51100000100514.
It is an arithmetic number, because the mean of its divisors is an integer number (51100000100514).
Almost surely, 2102200000201027 is an apocalyptic number.
102200000201027 is a deficient number, since it is larger than the sum of its proper divisors (1).
102200000201027 is an equidigital number, since it uses as much as digits as its factorization.
102200000201027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 17.
Adding to 102200000201027 its reverse (720102000002201), we get a palindrome (822302000203228).
The spelling of 102200000201027 in words is "one hundred two trillion, two hundred billion, two hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •