Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …1000100111000101001110 |
3 | 1110100012201111111201112012 |
4 | 2201230001320213011032 |
5 | 2424021024133341420 |
6 | 35344212511341222 |
7 | 2224515466536515 |
oct | 241540170470516 |
9 | 43305644451465 |
10 | 11111112012110 |
11 | 35a42180791a0 |
12 | 12b54a8b21812 |
13 | 627a09119296 |
14 | 2a5ad030367c |
15 | 14405b20bdc5 |
hex | a1b01e2714e |
11111112012110 has 128 divisors (see below), whose sum is σ = 22759938938880. Its totient is φ = 3869747481600.
The previous prime is 11111112011963. The next prime is 11111112012127. The reversal of 11111112012110 is 1121021111111.
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 63 ways as a sum of consecutive naturals, for example, 469029146 + ... + 469052834.
It is an arithmetic number, because the mean of its divisors is an integer number (177812022960).
Almost surely, 211111112012110 is an apocalyptic number.
11111112012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11111112012110 is an abundant number, since it is smaller than the sum of its proper divisors (11648826926770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111112012110 is a wasteful number, since it uses less digits than its factorization.
11111112012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25674.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 11111112012110 its reverse (1121021111111), we get a palindrome (12232133123221).
Subtracting from 11111112012110 its reverse (1121021111111), we obtain a palindrome (9990090900999).
The spelling of 11111112012110 in words is "eleven trillion, one hundred eleven billion, one hundred twelve million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •