Base | Representation |
---|---|
bin | 11101001010110101100… |
… | …101011100111111101101 |
3 | 21002121222010202020210211 |
4 | 131022311211130333231 |
5 | 230320204310113000 |
6 | 4132504414302421 |
7 | 264551260350646 |
oct | 35126545347755 |
9 | 7077863666724 |
10 | 2004501254125 |
11 | 703116778717 |
12 | 28459b4b7a11 |
13 | 11703cc89956 |
14 | 6d0386046cd |
15 | 3721d2677ba |
hex | 1d2b595cfed |
2004501254125 has 8 divisors (see below), whose sum is σ = 2501617565304. Its totient is φ = 1603601003200.
The previous prime is 2004501254123. The next prime is 2004501254141. The reversal of 2004501254125 is 5214521054002.
It can be written as a sum of positive squares in 4 ways, for example, as 7530941961 + 1996970312164 = 86781^2 + 1413142^2 .
It is not a de Polignac number, because 2004501254125 - 21 = 2004501254123 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2004501254123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8018004892 + ... + 8018005141.
It is an arithmetic number, because the mean of its divisors is an integer number (312702195663).
Almost surely, 22004501254125 is an apocalyptic number.
2004501254125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2004501254125 is a deficient number, since it is larger than the sum of its proper divisors (497116311179).
2004501254125 is an equidigital number, since it uses as much as digits as its factorization.
2004501254125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16036010048 (or 16036010038 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 31.
The spelling of 2004501254125 in words is "two trillion, four billion, five hundred one million, two hundred fifty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •