Base | Representation |
---|---|
bin | 100001010001001… |
… | …0100010000100000 |
3 | 2212210111111220220 |
4 | 1002202110100200 |
5 | 4241232322003 |
6 | 302434003040 |
7 | 36443220000 |
oct | 10242242040 |
9 | 2783444826 |
10 | 1116292128 |
11 | 523132886 |
12 | 271a16480 |
13 | 14a3664b3 |
14 | a8380000 |
15 | 68003353 |
hex | 42894420 |
1116292128 has 240 divisors, whose sum is σ = 3557494080. Its totient is φ = 306098688.
The previous prime is 1116292127. The next prime is 1116292141. The reversal of 1116292128 is 8212926111.
It is a super-2 number, since 2×11162921282 = 2492216230069536768, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1116292127) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6684301 + ... + 6684467.
It is an arithmetic number, because the mean of its divisors is an integer number (14822892).
Almost surely, 21116292128 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 1116292128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1778747040).
1116292128 is an abundant number, since it is smaller than the sum of its proper divisors (2441201952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116292128 is an equidigital number, since it uses as much as digits as its factorization.
1116292128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237 (or 208 counting only the distinct ones).
The product of its digits is 3456, while the sum is 33.
The square root of 1116292128 is about 33410.9582023623. The cubic root of 1116292128 is about 1037.3515353050.
The spelling of 1116292128 in words is "one billion, one hundred sixteen million, two hundred ninety-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •