Base | Representation |
---|---|
bin | 1111111001010… |
… | …0010000010101 |
3 | 11122110001200012 |
4 | 3332110100111 |
5 | 114031330131 |
6 | 10340530005 |
7 | 1436444003 |
oct | 376242025 |
9 | 148401605 |
10 | 66667541 |
11 | 346a5346 |
12 | 1a3b0905 |
13 | 10a72a65 |
14 | 8bd5a73 |
15 | 5cbd52b |
hex | 3f94415 |
66667541 has 2 divisors, whose sum is σ = 66667542. Its totient is φ = 66667540.
The previous prime is 66667537. The next prime is 66667567. The reversal of 66667541 is 14576666.
66667541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52635025 + 14032516 = 7255^2 + 3746^2 .
It is a cyclic number.
It is not a de Polignac number, because 66667541 - 22 = 66667537 is a prime.
It is a super-2 number, since 2×666675412 = 8889122045973362, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66667441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33333770 + 33333771.
It is an arithmetic number, because the mean of its divisors is an integer number (33333771).
Almost surely, 266667541 is an apocalyptic number.
It is an amenable number.
66667541 is a deficient number, since it is larger than the sum of its proper divisors (1).
66667541 is an equidigital number, since it uses as much as digits as its factorization.
66667541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 181440, while the sum is 41.
The square root of 66667541 is about 8165.0193508650. The cubic root of 66667541 is about 405.4819056545.
The spelling of 66667541 in words is "sixty-six million, six hundred sixty-seven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •