Base | Representation |
---|---|
bin | 111111100100110… |
… | …110100111101001 |
3 | 2202100001012010122 |
4 | 333210312213221 |
5 | 4141024004023 |
6 | 253501253025 |
7 | 35301111242 |
oct | 7744664751 |
9 | 2670035118 |
10 | 1066625513 |
11 | 4a809a598 |
12 | 259264175 |
13 | 13cc96a75 |
14 | a1931cc9 |
15 | 639922c8 |
hex | 3f9369e9 |
1066625513 has 2 divisors, whose sum is σ = 1066625514. Its totient is φ = 1066625512.
The previous prime is 1066625489. The next prime is 1066625519. The reversal of 1066625513 is 3155266601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 883753984 + 182871529 = 29728^2 + 13523^2 .
It is an emirp because it is prime and its reverse (3155266601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1066625513 - 214 = 1066609129 is a prime.
It is a super-2 number, since 2×10666255132 = 2275379969965026338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1066625519) 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 as a sum of consecutive naturals, namely, 533312756 + 533312757.
It is an arithmetic number, because the mean of its divisors is an integer number (533312757).
Almost surely, 21066625513 is an apocalyptic number.
It is an amenable number.
1066625513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1066625513 is an equidigital number, since it uses as much as digits as its factorization.
1066625513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 35.
The square root of 1066625513 is about 32659.2331967546. The cubic root of 1066625513 is about 1021.7327695045.
The spelling of 1066625513 in words is "one billion, sixty-six million, six hundred twenty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •