Base | Representation |
---|---|
bin | 10011110011010… |
… | …00111000100100 |
3 | 102120112222200200 |
4 | 21321220320210 |
5 | 320010321422 |
6 | 24252110500 |
7 | 4054603002 |
oct | 1171507044 |
9 | 376488620 |
10 | 166104612 |
11 | 85841943 |
12 | 47765430 |
13 | 2854a26b |
14 | 180bba72 |
15 | e8b12ac |
hex | 9e68e24 |
166104612 has 72 divisors (see below), whose sum is σ = 452830560. Its totient is φ = 51166080.
The previous prime is 166104599. The next prime is 166104613. The reversal of 166104612 is 216401661.
166104612 is a `hidden beast` number, since 1 + 6 + 610 + 46 + 1 + 2 = 666.
It is not an unprimeable number, because it can be changed into a prime (166104613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25083 + ... + 31005.
Almost surely, 2166104612 is an apocalyptic number.
166104612 is a gapful number since it is divisible by the number (12) 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 166104612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (226415280).
166104612 is an abundant number, since it is smaller than the sum of its proper divisors (286725948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166104612 is a wasteful number, since it uses less digits than its factorization.
166104612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5993 (or 5988 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 166104612 is about 12888.1578202628. The cubic root of 166104612 is about 549.7018902390.
The spelling of 166104612 in words is "one hundred sixty-six million, one hundred four thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •