Base | Representation |
---|---|
bin | 1010000111101010011010… |
… | …0111010011001010010100 |
3 | 1110101201010002010012022010 |
4 | 2201322212213103022110 |
5 | 2424300101204212341 |
6 | 35355321355304220 |
7 | 2225611333511232 |
oct | 241724647231224 |
9 | 43351102105263 |
10 | 11126760616596 |
11 | 35aa918326379 |
12 | 12b853574b070 |
13 | 62933114b071 |
14 | 2a6776723952 |
15 | 144674e40716 |
hex | a1ea69d3294 |
11126760616596 has 96 divisors (see below), whose sum is σ = 28237922842752. Its totient is φ = 3395764408320.
The previous prime is 11126760616553. The next prime is 11126760616619. The reversal of 11126760616596 is 69561606762111.
It is a super-2 number, since 2×111267606165962 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40751451 + ... + 41023581.
It is an arithmetic number, because the mean of its divisors is an integer number (294145029612).
Almost surely, 211126760616596 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 11126760616596, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14118961421376).
11126760616596 is an abundant number, since it is smaller than the sum of its proper divisors (17111162226156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11126760616596 is a wasteful number, since it uses less digits than its factorization.
11126760616596 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277609 (or 277607 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 57.
The spelling of 11126760616596 in words is "eleven trillion, one hundred twenty-six billion, seven hundred sixty million, six hundred sixteen thousand, five hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •