Base | Representation |
---|---|
bin | 1010000110011101011111… |
… | …00111010100100010011001 |
3 | 2220122110121221211112202021 |
4 | 11003032233213110202121 |
5 | 10402411112341130103 |
6 | 115124053133334441 |
7 | 4451531400361615 |
oct | 503165747244231 |
9 | 86573557745667 |
10 | 22212222208153 |
11 | 709417240199a |
12 | 25a8a64337421 |
13 | c517b00605b3 |
14 | 56b112130345 |
15 | 287bce2ecbbd |
hex | 1433af9d4899 |
22212222208153 has 2 divisors, whose sum is σ = 22212222208154. Its totient is φ = 22212222208152.
The previous prime is 22212222208123. The next prime is 22212222208177. The reversal of 22212222208153 is 35180222221222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13061306805849 + 9150915402304 = 3614043^2 + 3025048^2 .
It is a cyclic number.
It is not a de Polignac number, because 22212222208153 - 213 = 22212222199961 is a prime.
It is not a weakly prime, because it can be changed into another prime (22212222208123) 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, 11106111104076 + 11106111104077.
It is an arithmetic number, because the mean of its divisors is an integer number (11106111104077).
Almost surely, 222212222208153 is an apocalyptic number.
It is an amenable number.
22212222208153 is a deficient number, since it is larger than the sum of its proper divisors (1).
22212222208153 is an equidigital number, since it uses as much as digits as its factorization.
22212222208153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30720, while the sum is 34.
Adding to 22212222208153 its reverse (35180222221222), we get a palindrome (57392444429375).
The spelling of 22212222208153 in words is "twenty-two trillion, two hundred twelve billion, two hundred twenty-two million, two hundred eight thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •