Base | Representation |
---|---|
bin | 10011110011011… |
… | …00101001000000 |
3 | 102120120202210121 |
4 | 21321230221000 |
5 | 320011320000 |
6 | 24252310024 |
7 | 4054665604 |
oct | 1171545100 |
9 | 376522717 |
10 | 166120000 |
11 | 85852462 |
12 | 47772314 |
13 | 28554277 |
14 | 180c3504 |
15 | e8b5b1a |
hex | 9e6ca40 |
166120000 has 70 divisors (see below), whose sum is σ = 412022798. Its totient is φ = 66432000.
The previous prime is 166119997. The next prime is 166120027. The reversal of 166120000 is 21661.
It can be written as a sum of positive squares in 5 ways, for example, as 119771136 + 46348864 = 10944^2 + 6808^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 37924 + ... + 42076.
Almost surely, 2166120000 is an apocalyptic number.
166120000 is a gapful number since it is divisible by the number (10) 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 166120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (206011399).
166120000 is an abundant number, since it is smaller than the sum of its proper divisors (245902798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166120000 is an frugal number, since it uses more digits than its factorization.
166120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4185 (or 4160 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 166120000 is about 12888.7547885744. The cubic root of 166120000 is about 549.7188645851.
Adding to 166120000 its reverse (21661), we get a palindrome (166141661).
The spelling of 166120000 in words is "one hundred sixty-six million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •