Base | Representation |
---|---|
bin | 1111110000000… |
… | …1101010001000 |
3 | 11121022112222220 |
4 | 3330001222020 |
5 | 113403121310 |
6 | 10320014040 |
7 | 1431363252 |
oct | 374015210 |
9 | 147275886 |
10 | 66067080 |
11 | 343251a2 |
12 | 1a161320 |
13 | 108c2661 |
14 | 8abacd2 |
15 | 5c00670 |
hex | 3f01a88 |
66067080 has 64 divisors (see below), whose sum is σ = 200059200. Its totient is φ = 17452800.
The previous prime is 66067073. The next prime is 66067081. The reversal of 66067080 is 8076066.
It is not an unprimeable number, because it can be changed into a prime (66067081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10555 + ... + 15605.
It is an arithmetic number, because the mean of its divisors is an integer number (3125925).
Almost surely, 266067080 is an apocalyptic number.
66067080 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66067080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100029600).
66067080 is an abundant number, since it is smaller than the sum of its proper divisors (133992120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66067080 is a wasteful number, since it uses less digits than its factorization.
66067080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5174 (or 5170 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 66067080 is about 8128.1658447647. The cubic root of 66067080 is about 404.2608680176.
The spelling of 66067080 in words is "sixty-six million, sixty-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •