Base | Representation |
---|---|
bin | 10011110010100… |
… | …00111101111010 |
3 | 102120101000022110 |
4 | 21321100331322 |
5 | 314444203100 |
6 | 24250033150 |
7 | 4054014255 |
oct | 1171207572 |
9 | 376330273 |
10 | 166006650 |
11 | 85785287 |
12 | 477187b6 |
13 | 285147b4 |
14 | 1809409c |
15 | e892250 |
hex | 9e50f7a |
166006650 has 48 divisors (see below), whose sum is σ = 416937600. Its totient is φ = 43704960.
The previous prime is 166006639. The next prime is 166006661. The reversal of 166006650 is 56600661.
It is an interprime number because it is at equal distance from previous prime (166006639) and next prime (166006661).
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 4846 + ... + 18854.
It is an arithmetic number, because the mean of its divisors is an integer number (8686200).
Almost surely, 2166006650 is an apocalyptic number.
166006650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 166006650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (208468800).
166006650 is an abundant number, since it is smaller than the sum of its proper divisors (250930950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166006650 is a wasteful number, since it uses less digits than its factorization.
166006650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14103 (or 14098 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 166006650 is about 12884.3567941904. The cubic root of 166006650 is about 549.5938047669.
The spelling of 166006650 in words is "one hundred sixty-six million, six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •