Base | Representation |
---|---|
bin | 111110000101011011… |
… | …100101100000101100 |
3 | 20101001212101220022000 |
4 | 332011123211200230 |
5 | 2043011224020300 |
6 | 50342525452300 |
7 | 4546655043264 |
oct | 760533454054 |
9 | 211055356260 |
10 | 66663110700 |
11 | 262a965181a |
12 | 10b05411090 |
13 | 639501a644 |
14 | 33257967a4 |
15 | 1b026c2c00 |
hex | f856e582c |
66663110700 has 288 divisors, whose sum is σ = 220627545600. Its totient is φ = 17257847040.
The previous prime is 66663110671. The next prime is 66663110707. The reversal of 66663110700 is 701136666.
66663110700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (66663110707) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 20083641 + ... + 20086959.
Almost surely, 266663110700 is an apocalyptic number.
66663110700 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 66663110700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110313772800).
66663110700 is an abundant number, since it is smaller than the sum of its proper divisors (153964434900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66663110700 is a wasteful number, since it uses less digits than its factorization.
66663110700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3558 (or 3545 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The spelling of 66663110700 in words is "sixty-six billion, six hundred sixty-three million, one hundred ten thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •