Base | Representation |
---|---|
bin | 1010000110110011111000… |
… | …0001101000101110100110 |
3 | 1110100022022211010011221112 |
4 | 2201230332001220232212 |
5 | 2424030110434323420 |
6 | 35344500553545022 |
7 | 2224552501100540 |
oct | 241547601505646 |
9 | 43308284104845 |
10 | 11112121011110 |
11 | 35a4695689069 |
12 | 12b572aa15172 |
13 | 627b3a187502 |
14 | 2a5b88314690 |
15 | 1440b9ab98c5 |
hex | a1b3e068ba6 |
11112121011110 has 128 divisors (see below), whose sum is σ = 23909847287040. Its totient is φ = 3637767168000.
The previous prime is 11112121011077. The next prime is 11112121011157. The reversal of 11112121011110 is 1111012121111.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 175679090 + ... + 175742330.
It is an arithmetic number, because the mean of its divisors is an integer number (186795681930).
Almost surely, 211112121011110 is an apocalyptic number.
11112121011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11112121011110 is an abundant number, since it is smaller than the sum of its proper divisors (12797726275930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112121011110 is a wasteful number, since it uses less digits than its factorization.
11112121011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64242.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 11112121011110 its reverse (1111012121111), we get a palindrome (12223133132221).
The spelling of 11112121011110 in words is "eleven trillion, one hundred twelve billion, one hundred twenty-one million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •