Base | Representation |
---|---|
bin | 1001100101011110… |
… | …1011001001111101 |
3 | 20122022210001020101 |
4 | 2121113223021331 |
5 | 20232204321000 |
6 | 1103154521101 |
7 | 120523105642 |
oct | 23127531175 |
9 | 6568701211 |
10 | 2573120125 |
11 | 1100506264 |
12 | 5b9896191 |
13 | 3201211b4 |
14 | 1a5a45dc9 |
15 | 100d70e6a |
hex | 995eb27d |
2573120125 has 32 divisors (see below), whose sum is σ = 3489408000. Its totient is φ = 1887192000.
The previous prime is 2573120111. The next prime is 2573120131. The reversal of 2573120125 is 5210213752.
It is not a de Polignac number, because 2573120125 - 217 = 2572989053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2573120093 and 2573120102.
It is a congruent number.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 56151 + ... + 91099.
It is an arithmetic number, because the mean of its divisors is an integer number (109044000).
Almost surely, 22573120125 is an apocalyptic number.
2573120125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2573120125 is a deficient number, since it is larger than the sum of its proper divisors (916287875).
2573120125 is a wasteful number, since it uses less digits than its factorization.
2573120125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35014 (or 35004 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 28.
The square root of 2573120125 is about 50725.9314847938. The cubic root of 2573120125 is about 1370.3137656675.
Adding to 2573120125 its reverse (5210213752), we get a palindrome (7783333877).
The spelling of 2573120125 in words is "two billion, five hundred seventy-three million, one hundred twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •