Base | Representation |
---|---|
bin | 100001010000110… |
… | …0110101100110010 |
3 | 2212210011000221120 |
4 | 1002201212230302 |
5 | 4241210334042 |
6 | 302430003110 |
7 | 36441511650 |
oct | 10241465462 |
9 | 2783130846 |
10 | 1116105522 |
11 | 523015664 |
12 | 271946496 |
13 | 14a2cc58c |
14 | a8331dd0 |
15 | 67eb7dec |
hex | 42866b32 |
1116105522 has 128 divisors (see below), whose sum is σ = 2800189440. Its totient is φ = 289336320.
The previous prime is 1116105451. The next prime is 1116105527. The reversal of 1116105522 is 2255016111.
It is a junction number, because it is equal to n+sod(n) for n = 1116105492 and 1116105501.
It is not an unprimeable number, because it can be changed into a prime (1116105527) by changing a digit.
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, 2650872 + ... + 2651292.
It is an arithmetic number, because the mean of its divisors is an integer number (21876480).
Almost surely, 21116105522 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1116105522, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1400094720).
1116105522 is an abundant number, since it is smaller than the sum of its proper divisors (1684083918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116105522 is a wasteful number, since it uses less digits than its factorization.
1116105522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576.
The product of its (nonzero) digits is 600, while the sum is 24.
The square root of 1116105522 is about 33408.1654988717. The cubic root of 1116105522 is about 1037.2937288094.
The spelling of 1116105522 in words is "one billion, one hundred sixteen million, one hundred five thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •