Base | Representation |
---|---|
bin | 100010110000010… |
… | …0011000101001100 |
3 | 10000021100002001200 |
4 | 1011200203011030 |
5 | 4342014111304 |
6 | 311414505500 |
7 | 40620124656 |
oct | 10540430514 |
9 | 3007302050 |
10 | 1166160204 |
11 | 5492a3470 |
12 | 286665290 |
13 | 1577a6831 |
14 | b0c416d6 |
15 | 6c5a3e39 |
hex | 4582314c |
1166160204 has 72 divisors (see below), whose sum is σ = 3236430288. Its totient is φ = 351112320.
The previous prime is 1166160187. The next prime is 1166160221. The reversal of 1166160204 is 4020616611.
It is an interprime number because it is at equal distance from previous prime (1166160187) and next prime (1166160221).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 52794 + ... + 71550.
Almost surely, 21166160204 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 1166160204, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1618215144).
1166160204 is an abundant number, since it is smaller than the sum of its proper divisors (2070270084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1166160204 is a wasteful number, since it uses less digits than its factorization.
1166160204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18935 (or 18930 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 1166160204 is about 34149.0878941151. The cubic root of 1166160204 is about 1052.5742442121.
Adding to 1166160204 its reverse (4020616611), we get a palindrome (5186776815).
The spelling of 1166160204 in words is "one billion, one hundred sixty-six million, one hundred sixty thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •