Base | Representation |
---|---|
bin | 111111100100110… |
… | …011010100010101 |
3 | 2202100000111120202 |
4 | 333210303110111 |
5 | 4141023040424 |
6 | 253501110245 |
7 | 35301023642 |
oct | 7744632425 |
9 | 2670014522 |
10 | 1066611989 |
11 | 4a8090413 |
12 | 259258385 |
13 | 13cc90871 |
14 | a192adc9 |
15 | 6398d2ae |
hex | 3f933515 |
1066611989 has 2 divisors, whose sum is σ = 1066611990. Its totient is φ = 1066611988.
The previous prime is 1066611893. The next prime is 1066612021. The reversal of 1066611989 is 9891166601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1060609489 + 6002500 = 32567^2 + 2450^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1066611989 is a prime.
It is a super-2 number, since 2×10666119892 = 2275322270157072242, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1066616989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 533305994 + 533305995.
It is an arithmetic number, because the mean of its divisors is an integer number (533305995).
Almost surely, 21066611989 is an apocalyptic number.
It is an amenable number.
1066611989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1066611989 is an equidigital number, since it uses as much as digits as its factorization.
1066611989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 47.
The square root of 1066611989 is about 32659.0261489837. The cubic root of 1066611989 is about 1021.7284512215.
The spelling of 1066611989 in words is "one billion, sixty-six million, six hundred eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.983 sec. • engine limits •