Base | Representation |
---|---|
bin | 1010000111010001111110… |
… | …0100111111111011111110 |
3 | 1110101002011212101112201212 |
4 | 2201310133210333323332 |
5 | 2424143132212401420 |
6 | 35352314401204422 |
7 | 2225256632312162 |
oct | 241643744777376 |
9 | 43332155345655 |
10 | 11120200122110 |
11 | 35a806107a802 |
12 | 12b7204630712 |
13 | 628826c09171 |
14 | 2a63132d2ca2 |
15 | 1443ddee03c5 |
hex | a1d1f93fefe |
11120200122110 has 8 divisors (see below), whose sum is σ = 20016360219816. Its totient is φ = 4448080048840.
The previous prime is 11120200122071. The next prime is 11120200122131. The reversal of 11120200122110 is 1122100202111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×111202001221103 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 556010006096 + ... + 556010006115.
It is an arithmetic number, because the mean of its divisors is an integer number (2502045027477).
Almost surely, 211120200122110 is an apocalyptic number.
11120200122110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11120200122110 is a deficient number, since it is larger than the sum of its proper divisors (8896160097706).
11120200122110 is a wasteful number, since it uses less digits than its factorization.
11120200122110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112020012218.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11120200122110 its reverse (1122100202111), we get a palindrome (12242300324221).
The spelling of 11120200122110 in words is "eleven trillion, one hundred twenty billion, two hundred million, one hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •