Base | Representation |
---|---|
bin | 1010000000010100010000… |
… | …11110001111101101001001 |
3 | 2212220021201022221220122112 |
4 | 11000022020132033231021 |
5 | 10340431234200321022 |
6 | 114443101003432105 |
7 | 4430346032262503 |
oct | 500121036175511 |
9 | 85807638856575 |
10 | 22001112120137 |
11 | 701268a251177 |
12 | 2573b67b25635 |
13 | c37908080657 |
14 | 560c066c2d73 |
15 | 2824757e08e2 |
hex | 14028878fb49 |
22001112120137 has 2 divisors, whose sum is σ = 22001112120138. Its totient is φ = 22001112120136.
The previous prime is 22001112120133. The next prime is 22001112120149. The reversal of 22001112120137 is 73102121110022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21684026005321 + 317086114816 = 4656611^2 + 563104^2 .
It is a cyclic number.
It is not a de Polignac number, because 22001112120137 - 22 = 22001112120133 is a prime.
It is not a weakly prime, because it can be changed into another prime (22001112120131) 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, 11000556060068 + 11000556060069.
It is an arithmetic number, because the mean of its divisors is an integer number (11000556060069).
Almost surely, 222001112120137 is an apocalyptic number.
It is an amenable number.
22001112120137 is a deficient number, since it is larger than the sum of its proper divisors (1).
22001112120137 is an equidigital number, since it uses as much as digits as its factorization.
22001112120137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 22001112120137 its reverse (73102121110022), we get a palindrome (95103233230159).
The spelling of 22001112120137 in words is "twenty-two trillion, one billion, one hundred twelve million, one hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •