Base | Representation |
---|---|
bin | 100000110010100011111… |
… | …101011100010011011001 |
3 | 21222102012022011212121021 |
4 | 200302203331130103121 |
5 | 243404241243443100 |
6 | 4443054043442441 |
7 | 321540133024405 |
oct | 40624375342331 |
9 | 7872168155537 |
10 | 2253313656025 |
11 | 7996968a6933 |
12 | 30485a226421 |
13 | 134642ca7273 |
14 | 7b0bd3d4105 |
15 | 3d931b95a1a |
hex | 20ca3f5c4d9 |
2253313656025 has 24 divisors (see below), whose sum is σ = 2797874924544. Its totient is φ = 1800222278400.
The previous prime is 2253313655977. The next prime is 2253313656043. The reversal of 2253313656025 is 5206563133522.
2253313656025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2253313656025 - 215 = 2253313623257 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 114388977 + ... + 114408673.
It is an arithmetic number, because the mean of its divisors is an integer number (116578121856).
Almost surely, 22253313656025 is an apocalyptic number.
2253313656025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2253313656025 is a deficient number, since it is larger than the sum of its proper divisors (544561268519).
2253313656025 is a wasteful number, since it uses less digits than its factorization.
2253313656025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25641 (or 25636 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 43.
Adding to 2253313656025 its reverse (5206563133522), we get a palindrome (7459876789547).
The spelling of 2253313656025 in words is "two trillion, two hundred fifty-three billion, three hundred thirteen million, six hundred fifty-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •