Base | Representation |
---|---|
bin | 111111100100011… |
… | …011011011001101 |
3 | 2202022211112100011 |
4 | 333210123123031 |
5 | 4141011423000 |
6 | 253455033221 |
7 | 35300135425 |
oct | 7744333315 |
9 | 2668745304 |
10 | 1066514125 |
11 | 4a8023936 |
12 | 25920b811 |
13 | 13cc58161 |
14 | a1903485 |
15 | 6396e2ba |
hex | 3f91b6cd |
1066514125 has 16 divisors (see below), whose sum is σ = 1409307120. Its totient is φ = 803020800.
The previous prime is 1066514093. The next prime is 1066514129. The reversal of 1066514125 is 5214156601.
It can be written as a sum of positive squares in 8 ways, for example, as 10719076 + 1055795049 = 3274^2 + 32493^2 .
It is not a de Polignac number, because 1066514125 - 25 = 1066514093 is a prime.
It is a super-2 number, since 2×10665141252 = 2274904757649031250, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066514129) 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 15 ways as a sum of consecutive naturals, for example, 248820 + ... + 253069.
It is an arithmetic number, because the mean of its divisors is an integer number (88081695).
Almost surely, 21066514125 is an apocalyptic number.
It is an amenable number.
1066514125 is a deficient number, since it is larger than the sum of its proper divisors (342792995).
1066514125 is an equidigital number, since it uses as much as digits as its factorization.
1066514125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501921 (or 501911 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
The square root of 1066514125 is about 32657.5278458122. The cubic root of 1066514125 is about 1021.6972016536.
The spelling of 1066514125 in words is "one billion, sixty-six million, five hundred fourteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •