Base | Representation |
---|---|
bin | 111111011011010… |
… | …001111110011101 |
3 | 2202011022200220100 |
4 | 333123101332131 |
5 | 4134403204000 |
6 | 253331411313 |
7 | 35240560242 |
oct | 7733217635 |
9 | 2664280810 |
10 | 1064116125 |
11 | 4a6736216 |
12 | 258453b39 |
13 | 13c5c8817 |
14 | a147b5c9 |
15 | 63648a00 |
hex | 3f6d1f9d |
1064116125 has 24 divisors (see below), whose sum is σ = 1918248696. Its totient is φ = 567528000.
The previous prime is 1064116073. The next prime is 1064116181. The reversal of 1064116125 is 5216114601.
1064116125 is a `hidden beast` number, since 1 + 0 + 6 + 41 + 1 + 612 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 116964 + 1063999161 = 342^2 + 32619^2 .
It is not a de Polignac number, because 1064116125 - 28 = 1064115869 is a prime.
It is a super-2 number, since 2×10641161252 = 2264686254970031250, which contains 22 as substring.
It is a congruent 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, 471816 + ... + 474065.
It is an arithmetic number, because the mean of its divisors is an integer number (79927029).
Almost surely, 21064116125 is an apocalyptic number.
1064116125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1064116125 is a deficient number, since it is larger than the sum of its proper divisors (854132571).
1064116125 is an equidigital number, since it uses as much as digits as its factorization.
1064116125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945902 (or 945889 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 1064116125 is about 32620.7928321799. The cubic root of 1064116125 is about 1020.9308831764.
The spelling of 1064116125 in words is "one billion, sixty-four million, one hundred sixteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •