Base | Representation |
---|---|
bin | 100001011011010… |
… | …1000001110100100 |
3 | 2220011112001000010 |
4 | 1002312220032210 |
5 | 4244113214204 |
6 | 303144050220 |
7 | 36536404560 |
oct | 10266501644 |
9 | 2804461003 |
10 | 1121616804 |
11 | 52613a340 |
12 | 273763970 |
13 | 14b4abca9 |
14 | a8d686a0 |
15 | 68705d89 |
hex | 42da83a4 |
1121616804 has 192 divisors, whose sum is σ = 3448811520. Its totient is φ = 275066880.
The previous prime is 1121616791. The next prime is 1121616829. The reversal of 1121616804 is 4086161211.
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 63 ways as a sum of consecutive naturals, for example, 1891132 + ... + 1891724.
It is an arithmetic number, because the mean of its divisors is an integer number (17962560).
Almost surely, 21121616804 is an apocalyptic number.
1121616804 is a gapful number since it is divisible by the number (14) 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 1121616804, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1724405760).
1121616804 is an abundant number, since it is smaller than the sum of its proper divisors (2327194716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121616804 is a wasteful number, since it uses less digits than its factorization.
1121616804 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730 (or 728 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 30.
The square root of 1121616804 is about 33490.5479799898. The cubic root of 1121616804 is about 1038.9982970814.
The spelling of 1121616804 in words is "one billion, one hundred twenty-one million, six hundred sixteen thousand, eight hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •