Base | Representation |
---|---|
bin | 1000011010010000… |
… | …1000110010011101 |
3 | 12211100002222121012 |
4 | 2012210020302131 |
5 | 14110422321000 |
6 | 1012004345005 |
7 | 106642311605 |
oct | 20644106235 |
9 | 5740088535 |
10 | 2257620125 |
11 | a59405462 |
12 | 5300a5165 |
13 | 29c9572c7 |
14 | 175b99c05 |
15 | d32ee735 |
hex | 86908c9d |
2257620125 has 16 divisors (see below), whose sum is σ = 2819668800. Its totient is φ = 1804712400.
The previous prime is 2257620103. The next prime is 2257620139. The reversal of 2257620125 is 5210267522.
It is not a de Polignac number, because 2257620125 - 210 = 2257619101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2257620091 and 2257620100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 176186 + ... + 188564.
It is an arithmetic number, because the mean of its divisors is an integer number (176229300).
Almost surely, 22257620125 is an apocalyptic number.
2257620125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2257620125 is a deficient number, since it is larger than the sum of its proper divisors (562048675).
2257620125 is a wasteful number, since it uses less digits than its factorization.
2257620125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13853 (or 13843 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 32.
The square root of 2257620125 is about 47514.4201795623. The cubic root of 2257620125 is about 1311.8483174476.
Adding to 2257620125 its reverse (5210267522), we get a palindrome (7467887647).
The spelling of 2257620125 in words is "two billion, two hundred fifty-seven million, six hundred twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •