Base | Representation |
---|---|
bin | 1111110111011… |
… | …1010100010101 |
3 | 11122020001002021 |
4 | 3331313110111 |
5 | 114014032023 |
6 | 10334213141 |
7 | 1435441306 |
oct | 375672425 |
9 | 148201067 |
10 | 66549013 |
11 | 34624293 |
12 | 1a3541b1 |
13 | 10a30b1b |
14 | 8ba47ad |
15 | 5c9835d |
hex | 3f77515 |
66549013 has 2 divisors, whose sum is σ = 66549014. Its totient is φ = 66549012.
The previous prime is 66548981. The next prime is 66549019. The reversal of 66549013 is 31094566.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43335889 + 23213124 = 6583^2 + 4818^2 .
It is a cyclic number.
It is not a de Polignac number, because 66549013 - 25 = 66548981 is a prime.
It is a super-2 number, since 2×665490132 = 8857542262548338, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 66549013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66549019) 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, 33274506 + 33274507.
It is an arithmetic number, because the mean of its divisors is an integer number (33274507).
Almost surely, 266549013 is an apocalyptic number.
It is an amenable number.
66549013 is a deficient number, since it is larger than the sum of its proper divisors (1).
66549013 is an equidigital number, since it uses as much as digits as its factorization.
66549013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 34.
The square root of 66549013 is about 8157.7578414660. The cubic root of 66549013 is about 405.2414614581.
The spelling of 66549013 in words is "sixty-six million, five hundred forty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •