Base | Representation |
---|---|
bin | 10111001100100111100110… |
… | …010100000100000101110001 |
3 | 111101020020012002011011110201 |
4 | 113030213212110010011301 |
5 | 101333013002340414301 |
6 | 1000552210054355201 |
7 | 30326601526221031 |
oct | 2714474624040561 |
9 | 441206162134421 |
10 | 102022222201201 |
11 | 2a56442179a6a5 |
12 | b53870b95bb01 |
13 | 44c086758a8a3 |
14 | 1b29c8ab638c1 |
15 | bbdc7366d201 |
hex | 5cc9e6504171 |
102022222201201 has 2 divisors, whose sum is σ = 102022222201202. Its totient is φ = 102022222201200.
The previous prime is 102022222201199. The next prime is 102022222201217. The reversal of 102022222201201 is 102102222220201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68890398400576 + 33131823800625 = 8300024^2 + 5756025^2 .
It is a cyclic number.
It is not a de Polignac number, because 102022222201201 - 21 = 102022222201199 is a prime.
Together with 102022222201199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (102022222291201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51011111100600 + 51011111100601.
It is an arithmetic number, because the mean of its divisors is an integer number (51011111100601).
Almost surely, 2102022222201201 is an apocalyptic number.
It is an amenable number.
102022222201201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102022222201201 is an equidigital number, since it uses as much as digits as its factorization.
102022222201201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 102022222201201 its reverse (102102222220201), we get a palindrome (204124444421402).
The spelling of 102022222201201 in words is "one hundred two trillion, twenty-two billion, two hundred twenty-two million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •