Base | Representation |
---|---|
bin | 10011110011011… |
… | …00010001110000 |
3 | 102120120200202111 |
4 | 21321230101300 |
5 | 320011243022 |
6 | 24252255104 |
7 | 4054661350 |
oct | 1171542160 |
9 | 376520674 |
10 | 166118512 |
11 | 8585132a |
12 | 47771494 |
13 | 285536a1 |
14 | 180c2b60 |
15 | e8b5477 |
hex | 9e6c470 |
166118512 has 80 divisors (see below), whose sum is σ = 390689280. Its totient is φ = 66882816.
The previous prime is 166118471. The next prime is 166118521. The reversal of 166118512 is 215811661.
166118512 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 151438 + ... + 152530.
It is an arithmetic number, because the mean of its divisors is an integer number (4883616).
Almost surely, 2166118512 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 166118512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195344640).
166118512 is an abundant number, since it is smaller than the sum of its proper divisors (224570768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166118512 is a wasteful number, since it uses less digits than its factorization.
166118512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1190 (or 1184 counting only the distinct ones).
The product of its digits is 2880, while the sum is 31.
The square root of 166118512 is about 12888.6970637066. The cubic root of 166118512 is about 549.7172232332.
The spelling of 166118512 in words is "one hundred sixty-six million, one hundred eighteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •