Base | Representation |
---|---|
bin | 10011110010100… |
… | …10111011010000 |
3 | 102120101102022120 |
4 | 21321102323100 |
5 | 314444432142 |
6 | 24250134240 |
7 | 4054046535 |
oct | 1171227320 |
9 | 376342276 |
10 | 166014672 |
11 | 8579030a |
12 | 47721380 |
13 | 28518345 |
14 | 18096d8c |
15 | e8947ec |
hex | 9e52ed0 |
166014672 has 120 divisors (see below), whose sum is σ = 458051040. Its totient is φ = 51782400.
The previous prime is 166014659. The next prime is 166014689. The reversal of 166014672 is 276410661.
166014672 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 2721522 + ... + 2721582.
It is an arithmetic number, because the mean of its divisors is an integer number (3817092).
Almost surely, 2166014672 is an apocalyptic number.
166014672 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 166014672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (229025520).
166014672 is an abundant number, since it is smaller than the sum of its proper divisors (292036368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166014672 is a wasteful number, since it uses less digits than its factorization.
166014672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193 (or 156 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 166014672 is about 12884.6680981700. The cubic root of 166014672 is about 549.6026573651.
The spelling of 166014672 in words is "one hundred sixty-six million, fourteen thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •