Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1010000101101011111111 |
3 | 1102221200202120111110122010 |
4 | 2200011210222011223333 |
5 | 2420220223044444444 |
6 | 35221500252222303 |
7 | 2213542341056364 |
oct | 240054452055377 |
9 | 42850676443563 |
10 | 11001099999999 |
11 | 35615a417421a |
12 | 129810616a993 |
13 | 61a5262a4a25 |
14 | 2a06556b446b |
15 | 14126d0402b9 |
hex | a0164a85aff |
11001099999999 has 8 divisors (see below), whose sum is σ = 15064569369520. Its totient is φ = 7135848648576.
The previous prime is 11001099999977. The next prime is 11001100000043. The reversal of 11001099999999 is 99999999010011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11001099999999 - 213 = 11001099991807 is a prime.
It is a Duffinian number.
11001099999999 is a modest number, since divided by 9999999 gives 1100109 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 11001099999999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001099999959) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49554504394 + ... + 49554504615.
It is an arithmetic number, because the mean of its divisors is an integer number (1883071171190).
Almost surely, 211001099999999 is an apocalyptic number.
11001099999999 is a deficient number, since it is larger than the sum of its proper divisors (4063469369521).
11001099999999 is an equidigital number, since it uses as much as digits as its factorization.
11001099999999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99109009049.
The product of its (nonzero) digits is 43046721, while the sum is 75.
The spelling of 11001099999999 in words is "eleven trillion, one billion, ninety-nine million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •