Base | Representation |
---|---|
bin | 100000010101110100000… |
… | …011110010100001010101 |
3 | 21212110112000210222202112 |
4 | 200111310003302201111 |
5 | 242403031440224303 |
6 | 4420551030320405 |
7 | 316365156603512 |
oct | 40256403624125 |
9 | 7773460728675 |
10 | 2222445242453 |
11 | 787596444937 |
12 | 2ba8844b9105 |
13 | 131763a278a7 |
14 | 797d18d2309 |
15 | 3cc26bce0d8 |
hex | 205740f2855 |
2222445242453 has 2 divisors, whose sum is σ = 2222445242454. Its totient is φ = 2222445242452.
The previous prime is 2222445242383. The next prime is 2222445242467. The reversal of 2222445242453 is 3542425442222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2201549672644 + 20895569809 = 1483762^2 + 144553^2 .
It is a cyclic number.
It is not a de Polignac number, because 2222445242453 - 232 = 2218150275157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2222445242453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2222445242153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111222621226 + 1111222621227.
It is an arithmetic number, because the mean of its divisors is an integer number (1111222621227).
Almost surely, 22222445242453 is an apocalyptic number.
It is an amenable number.
2222445242453 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222445242453 is an equidigital number, since it uses as much as digits as its factorization.
2222445242453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1228800, while the sum is 41.
The spelling of 2222445242453 in words is "two trillion, two hundred twenty-two billion, four hundred forty-five million, two hundred forty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •