Base | Representation |
---|---|
bin | 11101001010110101100… |
… | …110001000011110100001 |
3 | 21002121222011002022010010 |
4 | 131022311212020132201 |
5 | 230320204331312400 |
6 | 4132504422155133 |
7 | 264551262022125 |
oct | 35126546103641 |
9 | 7077864068103 |
10 | 2004501432225 |
11 | 70311688a506 |
12 | 28459b582aa9 |
13 | 11704001ca36 |
14 | 6d03864d585 |
15 | 3721d2a0450 |
hex | 1d2b59887a1 |
2004501432225 has 24 divisors (see below), whose sum is σ = 3316163859072. Its totient is φ = 1068404584000.
The previous prime is 2004501432223. The next prime is 2004501432257. The reversal of 2004501432225 is 5222341054002.
It is not a de Polignac number, because 2004501432225 - 21 = 2004501432223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2004501432192 and 2004501432201.
It is not an unprimeable number, because it can be changed into a prime (2004501432223) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8163801 + ... + 8405750.
It is an arithmetic number, because the mean of its divisors is an integer number (138173494128).
Almost surely, 22004501432225 is an apocalyptic number.
2004501432225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2004501432225 is a deficient number, since it is larger than the sum of its proper divisors (1311662426847).
2004501432225 is a wasteful number, since it uses less digits than its factorization.
2004501432225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16571177 (or 16571172 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 2004501432225 its reverse (5222341054002), we get a palindrome (7226842486227).
The spelling of 2004501432225 in words is "two trillion, four billion, five hundred one million, four hundred thirty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •