Base | Representation |
---|---|
bin | 1010000001110110000111… |
… | …00001110101101000111111 |
3 | 2220002022022021011222112011 |
4 | 11000323003201311220333 |
5 | 10342311324441301442 |
6 | 114523145320352051 |
7 | 4434215551330564 |
oct | 500730341655077 |
9 | 86068267158464 |
10 | 22053642525247 |
11 | 70329962a5013 |
12 | 2582188315627 |
13 | c3c85a136cb8 |
14 | 56358b0da86b |
15 | 2839ec3ba117 |
hex | 140ec3875a3f |
22053642525247 has 2 divisors, whose sum is σ = 22053642525248. Its totient is φ = 22053642525246.
The previous prime is 22053642525199. The next prime is 22053642525259. The reversal of 22053642525247 is 74252524635022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22053642525247 - 27 = 22053642525119 is a prime.
It is a super-2 number, since 2×220536425252472 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22053642525247.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22053642525947) 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, 11026821262623 + 11026821262624.
It is an arithmetic number, because the mean of its divisors is an integer number (11026821262624).
Almost surely, 222053642525247 is an apocalyptic number.
22053642525247 is a deficient number, since it is larger than the sum of its proper divisors (1).
22053642525247 is an equidigital number, since it uses as much as digits as its factorization.
22053642525247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064000, while the sum is 49.
The spelling of 22053642525247 in words is "twenty-two trillion, fifty-three billion, six hundred forty-two million, five hundred twenty-five thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •