Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0100011011101001010110 |
3 | 1102221200210100101101221220 |
4 | 2200011211110123221112 |
5 | 2420220233420144430 |
6 | 35221501330151210 |
7 | 2213542534320024 |
oct | 240054524335126 |
9 | 42850710341856 |
10 | 11001111099990 |
11 | 35615aa465870 |
12 | 1298109a22506 |
13 | 61a52869017b |
14 | 2a0656d63714 |
15 | 14126ded4110 |
hex | a016551ba56 |
11001111099990 has 64 divisors (see below), whose sum is σ = 28803947404032. Its totient is φ = 2666839881600.
The previous prime is 11001111099919. The next prime is 11001111100013. The reversal of 11001111099990 is 9999011110011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8788944 + ... + 9962316.
It is an arithmetic number, because the mean of its divisors is an integer number (450061678188).
Almost surely, 211001111099990 is an apocalyptic number.
11001111099990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11001111099990 is an abundant number, since it is smaller than the sum of its proper divisors (17802836304042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001111099990 is a wasteful number, since it uses less digits than its factorization.
11001111099990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201805.
The product of its (nonzero) digits is 6561, while the sum is 42.
The spelling of 11001111099990 in words is "eleven trillion, one billion, one hundred eleven million, ninety-nine thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •