Base | Representation |
---|---|
bin | 1111111001000… |
… | …1011110100000 |
3 | 11122102111001200 |
4 | 3332101132200 |
5 | 114030444120 |
6 | 10340401200 |
7 | 1436365554 |
oct | 376213640 |
9 | 148374050 |
10 | 66656160 |
11 | 3469783a |
12 | 1a3a6200 |
13 | 10a6a81c |
14 | 8bd1864 |
15 | 5cb9e90 |
hex | 3f917a0 |
66656160 has 144 divisors (see below), whose sum is σ = 233218440. Its totient is φ = 17326080.
The previous prime is 66656153. The next prime is 66656179. The reversal of 66656160 is 6165666.
It can be written as a sum of positive squares in 4 ways, for example, as 20034576 + 46621584 = 4476^2 + 6828^2 .
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58476 + ... + 59604.
Almost surely, 266656160 is an apocalyptic number.
66656160 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 66656160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116609220).
66656160 is an abundant number, since it is smaller than the sum of its proper divisors (166562280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66656160 is a wasteful number, since it uses less digits than its factorization.
66656160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1191 (or 1180 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The square root of 66656160 is about 8164.3223846196. The cubic root of 66656160 is about 405.4588306961.
The spelling of 66656160 in words is "sixty-six million, six hundred fifty-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •