Base | Representation |
---|---|
bin | 1111110000001… |
… | …1101000001110 |
3 | 11121022222001210 |
4 | 3330003220032 |
5 | 113403401100 |
6 | 10320115250 |
7 | 1431425631 |
oct | 374035016 |
9 | 147288053 |
10 | 66075150 |
11 | 34330269 |
12 | 1a165b26 |
13 | 108c622b |
14 | 8abdc18 |
15 | 5c02c50 |
hex | 3f03a0e |
66075150 has 24 divisors (see below), whose sum is σ = 163866744. Its totient is φ = 17620000.
The previous prime is 66075143. The next prime is 66075157. The reversal of 66075150 is 5157066.
66075150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (66075143) and next prime (66075157).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66075157) 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 in 11 ways as a sum of consecutive naturals, for example, 220101 + ... + 220400.
It is an arithmetic number, because the mean of its divisors is an integer number (6827781).
Almost surely, 266075150 is an apocalyptic number.
66075150 is an abundant number, since it is smaller than the sum of its proper divisors (97791594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66075150 is a wasteful number, since it uses less digits than its factorization.
66075150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440516 (or 440511 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 66075150 is about 8128.6622515639. The cubic root of 66075150 is about 404.2773273111.
The spelling of 66075150 in words is "sixty-six million, seventy-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •