Base | Representation |
---|---|
bin | 10111001100100111100101… |
… | …101001110010111101101001 |
3 | 111101020020011022022020021221 |
4 | 113030213211221302331221 |
5 | 101333012442021333001 |
6 | 1000552205021102041 |
7 | 30326601333102163 |
oct | 2714474551627551 |
9 | 441206138266257 |
10 | 102022211121001 |
11 | 2a564416511a06 |
12 | b5387080b7921 |
13 | 44c08651ab462 |
14 | 1b29c894bb933 |
15 | bbdc726d01a1 |
hex | 5cc9e5a72f69 |
102022211121001 has 2 divisors, whose sum is σ = 102022211121002. Its totient is φ = 102022211121000.
The previous prime is 102022211120983. The next prime is 102022211121011. The reversal of 102022211121001 is 100121112220201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54194626890000 + 47827584231001 = 7361700^2 + 6915749^2 .
It is an emirp because it is prime and its reverse (100121112220201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102022211121001 - 25 = 102022211120969 is a prime.
It is not a weakly prime, because it can be changed into another prime (102022211121011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51011105560500 + 51011105560501.
It is an arithmetic number, because the mean of its divisors is an integer number (51011105560501).
Almost surely, 2102022211121001 is an apocalyptic number.
It is an amenable number.
102022211121001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102022211121001 is an equidigital number, since it uses as much as digits as its factorization.
102022211121001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102022211121001 its reverse (100121112220201), we get a palindrome (202143323341202).
The spelling of 102022211121001 in words is "one hundred two trillion, twenty-two billion, two hundred eleven million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •