Base | Representation |
---|---|
bin | 1010000110110011111000… |
… | …0001111110011011100101 |
3 | 1110100022022211021200212221 |
4 | 2201230332001332123211 |
5 | 2424030111000200010 |
6 | 35344500555512341 |
7 | 2224552501620652 |
oct | 241547601763345 |
9 | 43308284250787 |
10 | 11112121100005 |
11 | 35a4695739932 |
12 | 12b572aa586b1 |
13 | 627b3a1b8b03 |
14 | 2a5b88338c29 |
15 | 1440b9ad5dda |
hex | a1b3e07e6e5 |
11112121100005 has 8 divisors (see below), whose sum is σ = 13764691943424. Its totient is φ = 8602932464400.
The previous prime is 11112121099999. The next prime is 11112121100009. The reversal of 11112121100005 is 50000112121111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11112121100005 - 25 = 11112121099973 is a prime.
It is a super-2 number, since 2×111121211000052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112121100009) 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, 35845551781 + ... + 35845552090.
It is an arithmetic number, because the mean of its divisors is an integer number (1720586492928).
Almost surely, 211112121100005 is an apocalyptic number.
It is an amenable number.
11112121100005 is a deficient number, since it is larger than the sum of its proper divisors (2652570843419).
11112121100005 is an equidigital number, since it uses as much as digits as its factorization.
11112121100005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71691103907.
The product of its (nonzero) digits is 20, while the sum is 16.
Adding to 11112121100005 its reverse (50000112121111), we get a palindrome (61112233221116).
The spelling of 11112121100005 in words is "eleven trillion, one hundred twelve billion, one hundred twenty-one million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •