Base | Representation |
---|---|
bin | 1010000000010010100110… |
… | …1101101111010010110110 |
3 | 1102221121012122201012101100 |
4 | 2200010221231233102312 |
5 | 2420211211420213420 |
6 | 35221214204510530 |
7 | 2213506002422265 |
oct | 240045155572266 |
9 | 42847178635340 |
10 | 11000111101110 |
11 | 3561136a4290a |
12 | 1297a8ab4b446 |
13 | 61a3c9453661 |
14 | 2a05a02165dc |
15 | 141211303190 |
hex | a0129b6f4b6 |
11000111101110 has 96 divisors (see below), whose sum is σ = 30089691227232. Its totient is φ = 2784471068160.
The previous prime is 11000111101103. The next prime is 11000111101153. The reversal of 11000111101110 is 1110111100011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11000111101092 and 11000111101101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40148064 + ... + 40421123.
It is an arithmetic number, because the mean of its divisors is an integer number (313434283617).
Almost surely, 211000111101110 is an apocalyptic number.
11000111101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000111101110 is an abundant number, since it is smaller than the sum of its proper divisors (19089580126122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000111101110 is a wasteful number, since it uses less digits than its factorization.
11000111101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80569278 (or 80569275 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11000111101110 its reverse (1110111100011), we get a palindrome (12110222201121).
The spelling of 11000111101110 in words is "eleven trillion, one hundred eleven million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •