Base | Representation |
---|---|
bin | 1010000011110101101001… |
… | …00100110011011010001101 |
3 | 2220022212000221221000202022 |
4 | 11001322310210303122031 |
5 | 10344422040421333122 |
6 | 115014431344135525 |
7 | 4442161351645124 |
oct | 501726444633215 |
9 | 86285027830668 |
10 | 22122111121037 |
11 | 7059a31007474 |
12 | 25934b63075a5 |
13 | c4614c2151c5 |
14 | 566a04596abb |
15 | 2856a832b642 |
hex | 141eb493368d |
22122111121037 has 2 divisors, whose sum is σ = 22122111121038. Its totient is φ = 22122111121036.
The previous prime is 22122111121003. The next prime is 22122111121051. The reversal of 22122111121037 is 73012111122122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20128045172041 + 1994065948996 = 4486429^2 + 1412114^2 .
It is a cyclic number.
It is not a de Polignac number, because 22122111121037 - 210 = 22122111120013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22122111120997 and 22122111121015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22122111121937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11061055560518 + 11061055560519.
It is an arithmetic number, because the mean of its divisors is an integer number (11061055560519).
Almost surely, 222122111121037 is an apocalyptic number.
It is an amenable number.
22122111121037 is a deficient number, since it is larger than the sum of its proper divisors (1).
22122111121037 is an equidigital number, since it uses as much as digits as its factorization.
22122111121037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 26.
Adding to 22122111121037 its reverse (73012111122122), we get a palindrome (95134222243159).
The spelling of 22122111121037 in words is "twenty-two trillion, one hundred twenty-two billion, one hundred eleven million, one hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •