Base | Representation |
---|---|
bin | 10011110110101… |
… | …10000000110110 |
3 | 102121101200212000 |
4 | 21323112000312 |
5 | 320114122411 |
6 | 24305440130 |
7 | 4061444124 |
oct | 1173260066 |
9 | 377350760 |
10 | 166551606 |
11 | 86017761 |
12 | 47940046 |
13 | 28675860 |
14 | 18196914 |
15 | e94d956 |
hex | 9ed6036 |
166551606 has 64 divisors (see below), whose sum is σ = 419596800. Its totient is φ = 48545568.
The previous prime is 166551589. The next prime is 166551613. The reversal of 166551606 is 606155661.
166551606 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1665516062 = 55478874922358472, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7095 + ... + 19581.
It is an arithmetic number, because the mean of its divisors is an integer number (6556200).
Almost surely, 2166551606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 166551606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209798400).
166551606 is an abundant number, since it is smaller than the sum of its proper divisors (253045194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166551606 is a wasteful number, since it uses less digits than its factorization.
166551606 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12530 (or 12524 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The square root of 166551606 is about 12905.4874375205. The cubic root of 166551606 is about 550.1945383450.
The spelling of 166551606 in words is "one hundred sixty-six million, five hundred fifty-one thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •