Base | Representation |
---|---|
bin | 1111111000110… |
… | …0110101011101 |
3 | 11122101111222120 |
4 | 3332030311131 |
5 | 114024342044 |
6 | 10340133153 |
7 | 1436256255 |
oct | 376146535 |
9 | 148344876 |
10 | 66637149 |
11 | 34684527 |
12 | 1a3971b9 |
13 | 10a61c87 |
14 | 8bc8965 |
15 | 5cb4519 |
hex | 3f8cd5d |
66637149 has 8 divisors (see below), whose sum is σ = 88920000. Its totient is φ = 44389536.
The previous prime is 66637147. The next prime is 66637159. The reversal of 66637149 is 94173666.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 66637149 - 21 = 66637147 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 66637149.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66637147) 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 in 7 ways as a sum of consecutive naturals, for example, 4024 + ... + 12225.
It is an arithmetic number, because the mean of its divisors is an integer number (11115000).
Almost surely, 266637149 is an apocalyptic number.
It is an amenable number.
66637149 is a deficient number, since it is larger than the sum of its proper divisors (22282851).
66637149 is a wasteful number, since it uses less digits than its factorization.
66637149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17619.
The product of its digits is 163296, while the sum is 42.
The square root of 66637149 is about 8163.1580286063. The cubic root of 66637149 is about 405.4202800667.
The spelling of 66637149 in words is "sixty-six million, six hundred thirty-seven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •