Base | Representation |
---|---|
bin | 1010000011110001111001… |
… | …10101011111000010011001 |
3 | 2220022122211221211200201222 |
4 | 11001320330311133002121 |
5 | 10344403432132244441 |
6 | 115013500142421425 |
7 | 4442060516434352 |
oct | 501707465370231 |
9 | 86278757750658 |
10 | 22120102228121 |
11 | 70590a0046497 |
12 | 2593035591875 |
13 | c45bbbc76181 |
14 | 566893864d29 |
15 | 2855dbcadd4b |
hex | 141e3cd5f099 |
22120102228121 has 2 divisors, whose sum is σ = 22120102228122. Its totient is φ = 22120102228120.
The previous prime is 22120102228111. The next prime is 22120102228123. The reversal of 22120102228121 is 12182220102122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16777740292096 + 5342361936025 = 4096064^2 + 2311355^2 .
It is a cyclic number.
It is not a de Polignac number, because 22120102228121 - 26 = 22120102228057 is a prime.
Together with 22120102228123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (22120102228123) 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, 11060051114060 + 11060051114061.
It is an arithmetic number, because the mean of its divisors is an integer number (11060051114061).
Almost surely, 222120102228121 is an apocalyptic number.
It is an amenable number.
22120102228121 is a deficient number, since it is larger than the sum of its proper divisors (1).
22120102228121 is an equidigital number, since it uses as much as digits as its factorization.
22120102228121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 26.
The spelling of 22120102228121 in words is "twenty-two trillion, one hundred twenty billion, one hundred two million, two hundred twenty-eight thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •