Base | Representation |
---|---|
bin | 101011110001101… |
… | …1010101011101101 |
3 | 10210100222221220102 |
4 | 1113203122223231 |
5 | 11002014332000 |
6 | 401431400445 |
7 | 51254314325 |
oct | 12743325355 |
9 | 3710887812 |
10 | 1468902125 |
11 | 69417a9a9 |
12 | 34bb23125 |
13 | 1a5424672 |
14 | dd12a285 |
15 | 88e553d5 |
hex | 578daaed |
1468902125 has 8 divisors (see below), whose sum is σ = 1833190008. Its totient is φ = 1175121600.
The previous prime is 1468902091. The next prime is 1468902247. The reversal of 1468902125 is 5212098641.
It can be written as a sum of positive squares in 4 ways, for example, as 449185636 + 1019716489 = 21194^2 + 31933^2 .
It is not a de Polignac number, because 1468902125 - 210 = 1468901101 is a prime.
It is a super-3 number, since 3×14689021253 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
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 7 ways as a sum of consecutive naturals, for example, 5875484 + ... + 5875733.
It is an arithmetic number, because the mean of its divisors is an integer number (229148751).
Almost surely, 21468902125 is an apocalyptic number.
It is an amenable number.
1468902125 is a deficient number, since it is larger than the sum of its proper divisors (364287883).
1468902125 is an equidigital number, since it uses as much as digits as its factorization.
1468902125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11751232 (or 11751222 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 38.
The square root of 1468902125 is about 38326.2589486634. The cubic root of 1468902125 is about 1136.7482292654.
The spelling of 1468902125 in words is "one billion, four hundred sixty-eight million, nine hundred two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •