Base | Representation |
---|---|
bin | 1001001001100101… |
… | …0111111100101111 |
3 | 20100011122002102011 |
4 | 2102121113330233 |
5 | 20012232001411 |
6 | 1043415142051 |
7 | 114602501650 |
oct | 22231277457 |
9 | 6304562364 |
10 | 2456125231 |
11 | 105046726a |
12 | 586674927 |
13 | 301b0a051 |
14 | 1942ad527 |
15 | e5960c21 |
hex | 92657f2f |
2456125231 has 48 divisors (see below), whose sum is σ = 3083234880. Its totient is φ = 1914762240.
The previous prime is 2456125229. The next prime is 2456125253. The reversal of 2456125231 is 1325216542.
It is not a de Polignac number, because 2456125231 - 21 = 2456125229 is a prime.
It is a super-2 number, since 2×24561252312 = 12065102300709606722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2456125193 and 2456125202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2456125271) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 10191271 + ... + 10191511.
It is an arithmetic number, because the mean of its divisors is an integer number (64234060).
Almost surely, 22456125231 is an apocalyptic number.
2456125231 is a deficient number, since it is larger than the sum of its proper divisors (627109649).
2456125231 is a wasteful number, since it uses less digits than its factorization.
2456125231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432 (or 413 counting only the distinct ones).
The product of its digits is 14400, while the sum is 31.
The square root of 2456125231 is about 49559.3102353130. The cubic root of 2456125231 is about 1349.2222737623. Note that the first 4 decimals are identical.
The spelling of 2456125231 in words is "two billion, four hundred fifty-six million, one hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •