Base | Representation |
---|---|
bin | 1010000110110011011011… |
… | …0100000101111010001110 |
3 | 1110100022000101110012111101 |
4 | 2201230312310011322032 |
5 | 2424024334001120420 |
6 | 35344440552413314 |
7 | 2224546501511233 |
oct | 241546664057216 |
9 | 43308011405441 |
10 | 11112000020110 |
11 | 35a463335a800 |
12 | 12b56b63a723a |
13 | 627b1b0a44c2 |
14 | 2a5b7621b78a |
15 | 1440ae16a60a |
hex | a1b36d05e8e |
11112000020110 has 48 divisors (see below), whose sum is σ = 22002835050000. Its totient is φ = 4037491560960.
The previous prime is 11112000020083. The next prime is 11112000020131. The reversal of 11112000020110 is 1102000021111.
11112000020110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2165040 + ... + 5187619.
It is an arithmetic number, because the mean of its divisors is an integer number (458392396875).
Almost surely, 211112000020110 is an apocalyptic number.
11112000020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11112000020110 is a deficient number, since it is larger than the sum of its proper divisors (10890835029890).
11112000020110 is a wasteful number, since it uses less digits than its factorization.
11112000020110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7353937 (or 7353926 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11112000020110 its reverse (1102000021111), we get a palindrome (12214000041221).
The spelling of 11112000020110 in words is "eleven trillion, one hundred twelve billion, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •