Base | Representation |
---|---|
bin | 10011110111000… |
… | …11000011101100 |
3 | 102121111102010220 |
4 | 21323203003230 |
5 | 320122330121 |
6 | 24310531340 |
7 | 4062055653 |
oct | 1173430354 |
9 | 377442126 |
10 | 166605036 |
11 | 86053914 |
12 | 47966b50 |
13 | 28693c80 |
14 | 181ac19a |
15 | e95e6c6 |
hex | 9ee30ec |
166605036 has 96 divisors (see below), whose sum is σ = 441950208. Its totient is φ = 48487680.
The previous prime is 166605011. The next prime is 166605037. The reversal of 166605036 is 630506661.
It is a super-2 number, since 2×1666050362 = 55514476041122592, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 166604988 and 166605006.
It is not an unprimeable number, because it can be changed into a prime (166605037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226926 + ... + 227658.
It is an arithmetic number, because the mean of its divisors is an integer number (4603648).
Almost surely, 2166605036 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 166605036, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (220975104).
166605036 is an abundant number, since it is smaller than the sum of its proper divisors (275345172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166605036 is a wasteful number, since it uses less digits than its factorization.
166605036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 831 (or 829 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
The square root of 166605036 is about 12907.5573211975. The cubic root of 166605036 is about 550.2533664603.
The spelling of 166605036 in words is "one hundred sixty-six million, six hundred five thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •