Base | Representation |
---|---|
bin | 100110011001… |
… | …101100001100 |
3 | 200221102220202 |
4 | 212121230030 |
5 | 10034113300 |
6 | 555433032 |
7 | 151364660 |
oct | 46315414 |
9 | 20842822 |
10 | 10066700 |
11 | 5756296 |
12 | 3455778 |
13 | 2116037 |
14 | 14a08a0 |
15 | d3cad5 |
hex | 999b0c |
10066700 has 72 divisors (see below), whose sum is σ = 25435872. Its totient is φ = 3386880.
The previous prime is 10066699. The next prime is 10066711. The reversal of 10066700 is 766001.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a plaindrome in base 12.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 51002 + ... + 51198.
It is an arithmetic number, because the mean of its divisors is an integer number (353276).
Almost surely, 210066700 is an apocalyptic number.
10066700 is a gapful number since it is divisible by the number (10) 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 10066700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12717936).
10066700 is an abundant number, since it is smaller than the sum of its proper divisors (15369172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10066700 is a wasteful number, since it uses less digits than its factorization.
10066700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291 (or 284 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 20.
The square root of 10066700 is about 3172.8063287884. The cubic root of 10066700 is about 215.9214105956.
The spelling of 10066700 in words is "ten million, sixty-six thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •