Base | Representation |
---|---|
bin | 100100101100110011001… |
… | …010100010101011000011 |
3 | 22221002201210211221210112 |
4 | 210230303022202223003 |
5 | 312310031034013402 |
6 | 5210332010421535 |
7 | 350131421013344 |
oct | 44546312425303 |
9 | 8832653757715 |
10 | 2522004204227 |
11 | 892637696632 |
12 | 3489461318ab |
13 | 153a93376921 |
14 | 8a0cc22a0cb |
15 | 4590a7bee52 |
hex | 24b332a2ac3 |
2522004204227 has 2 divisors, whose sum is σ = 2522004204228. Its totient is φ = 2522004204226.
The previous prime is 2522004204221. The next prime is 2522004204257. The reversal of 2522004204227 is 7224024002252.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2522004204227 - 216 = 2522004138691 is a prime.
It is a super-2 number, since 2×25220042042272 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2522004204193 and 2522004204202.
It is not a weakly prime, because it can be changed into another prime (2522004204221) 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, 1261002102113 + 1261002102114.
It is an arithmetic number, because the mean of its divisors is an integer number (1261002102114).
Almost surely, 22522004204227 is an apocalyptic number.
2522004204227 is a deficient number, since it is larger than the sum of its proper divisors (1).
2522004204227 is an equidigital number, since it uses as much as digits as its factorization.
2522004204227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35840, while the sum is 32.
Adding to 2522004204227 its reverse (7224024002252), we get a palindrome (9746028206479).
The spelling of 2522004204227 in words is "two trillion, five hundred twenty-two billion, four million, two hundred four thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •