Base | Representation |
---|---|
bin | 111111100100000… |
… | …111100010001001 |
3 | 2202022200101120112 |
4 | 333210013202021 |
5 | 4141001321044 |
6 | 253453204105 |
7 | 35266346042 |
oct | 7744074211 |
9 | 2668611515 |
10 | 1066432649 |
11 | 4a7a786a7 |
12 | 259190635 |
13 | 13cc2a049 |
14 | a18c18c9 |
15 | 6395509e |
hex | 3f907889 |
1066432649 has 2 divisors, whose sum is σ = 1066432650. Its totient is φ = 1066432648.
The previous prime is 1066432597. The next prime is 1066432657. The reversal of 1066432649 is 9462346601.
1066432649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1035552400 + 30880249 = 32180^2 + 5557^2 .
It is a cyclic number.
It is not a de Polignac number, because 1066432649 - 212 = 1066428553 is a prime.
It is a super-2 number, since 2×10664326492 = 2274557189706314402, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1066432349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 533216324 + 533216325.
It is an arithmetic number, because the mean of its divisors is an integer number (533216325).
Almost surely, 21066432649 is an apocalyptic number.
It is an amenable number.
1066432649 is a deficient number, since it is larger than the sum of its proper divisors (1).
1066432649 is an equidigital number, since it uses as much as digits as its factorization.
1066432649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 41.
The square root of 1066432649 is about 32656.2803913734. The cubic root of 1066432649 is about 1021.6711835825.
The spelling of 1066432649 in words is "one billion, sixty-six million, four hundred thirty-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •