Base | Representation |
---|---|
bin | 1011111110000… |
… | …01111101001110 |
3 | 20222221022111000 |
4 | 11333001331032 |
5 | 201201043131 |
6 | 13544041130 |
7 | 2326315044 |
oct | 577017516 |
9 | 228838430 |
10 | 100409166 |
11 | 51750990 |
12 | 297631a6 |
13 | 17a57b10 |
14 | d49a394 |
15 | 8c35ce6 |
hex | 5fc1f4e |
100409166 has 64 divisors (see below), whose sum is σ = 262160640. Its totient is φ = 28084320.
The previous prime is 100409161. The next prime is 100409213. The reversal of 100409166 is 661904001.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100409161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1221 + ... + 14223.
It is an arithmetic number, because the mean of its divisors is an integer number (4096260).
Almost surely, 2100409166 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100409166, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131080320).
100409166 is an abundant number, since it is smaller than the sum of its proper divisors (161751474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100409166 is a wasteful number, since it uses less digits than its factorization.
100409166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13038 (or 13032 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 100409166 is about 10020.4374156022. The cubic root of 100409166 is about 464.7910820086.
The spelling of 100409166 in words is "one hundred million, four hundred nine thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •