Base | Representation |
---|---|
bin | 1010000000101000110001… |
… | …01101101011110100010001 |
3 | 2212221100010122000211111122 |
4 | 11000110120231223310101 |
5 | 10341121311214134022 |
6 | 114452121304052025 |
7 | 4431215622013313 |
oct | 500243055536421 |
9 | 85840118024448 |
10 | 22012122021137 |
11 | 701731a031806 |
12 | 257611b164015 |
13 | c38971063781 |
14 | 56156ca0d7b3 |
15 | 2828bc188742 |
hex | 140518b6bd11 |
22012122021137 has 2 divisors, whose sum is σ = 22012122021138. Its totient is φ = 22012122021136.
The previous prime is 22012122021079. The next prime is 22012122021151. The reversal of 22012122021137 is 73112022121022.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20514413552656 + 1497708468481 = 4529284^2 + 1223809^2 .
It is a cyclic number.
It is not a de Polignac number, because 22012122021137 - 26 = 22012122021073 is a prime.
It is not a weakly prime, because it can be changed into another prime (22012122821137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11006061010568 + 11006061010569.
It is an arithmetic number, because the mean of its divisors is an integer number (11006061010569).
Almost surely, 222012122021137 is an apocalyptic number.
It is an amenable number.
22012122021137 is a deficient number, since it is larger than the sum of its proper divisors (1).
22012122021137 is an equidigital number, since it uses as much as digits as its factorization.
22012122021137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
Adding to 22012122021137 its reverse (73112022121022), we get a palindrome (95124144142159).
The spelling of 22012122021137 in words is "twenty-two trillion, twelve billion, one hundred twenty-two million, twenty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •