Base | Representation |
---|---|
bin | 1010010001111001111001… |
… | …11001110011110010101001 |
3 | 2222001001120121110001112122 |
4 | 11020330330321303302221 |
5 | 10430331412233304103 |
6 | 120024443205121025 |
7 | 4522121513205503 |
oct | 510747471636251 |
9 | 88031517401478 |
10 | 22605434666153 |
11 | 7225a02601549 |
12 | 26511023b9175 |
13 | c7c8b63c25a1 |
14 | 582174a7cd73 |
15 | 293044d97b38 |
hex | 148f3ce73ca9 |
22605434666153 has 2 divisors, whose sum is σ = 22605434666154. Its totient is φ = 22605434666152.
The previous prime is 22605434666071. The next prime is 22605434666233. The reversal of 22605434666153 is 35166643450622.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12993624180889 + 9611810485264 = 3604667^2 + 3100292^2 .
It is a cyclic number.
It is not a de Polignac number, because 22605434666153 - 28 = 22605434665897 is a prime.
It is a super-2 number, since 2×226054346661532 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22605434666095 and 22605434666104.
It is not a weakly prime, because it can be changed into another prime (22605434666653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11302717333076 + 11302717333077.
It is an arithmetic number, because the mean of its divisors is an integer number (11302717333077).
Almost surely, 222605434666153 is an apocalyptic number.
It is an amenable number.
22605434666153 is a deficient number, since it is larger than the sum of its proper divisors (1).
22605434666153 is an equidigital number, since it uses as much as digits as its factorization.
22605434666153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18662400, while the sum is 53.
The spelling of 22605434666153 in words is "twenty-two trillion, six hundred five billion, four hundred thirty-four million, six hundred sixty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •