Base | Representation |
---|---|
bin | 1010000110110011011011… |
… | …0100000101111010010000 |
3 | 1110100022000101110012111110 |
4 | 2201230312310011322100 |
5 | 2424024334001120422 |
6 | 35344440552413320 |
7 | 2224546501511235 |
oct | 241546664057220 |
9 | 43308011405443 |
10 | 11112000020112 |
11 | 35a463335a802 |
12 | 12b56b63a7240 |
13 | 627b1b0a44c4 |
14 | 2a5b7621b78c |
15 | 1440ae16a60c |
hex | a1b36d05e90 |
11112000020112 has 40 divisors (see below), whose sum is σ = 29632000057600. Its totient is φ = 3584516135040.
The previous prime is 11112000020083. The next prime is 11112000020131. The reversal of 11112000020112 is 21102000021111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3733869487 + ... + 3733872462.
It is an arithmetic number, because the mean of its divisors is an integer number (740800001440).
Almost surely, 211112000020112 is an apocalyptic number.
11112000020112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11112000020112 is an abundant number, since it is smaller than the sum of its proper divisors (18520000037488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112000020112 is a wasteful number, since it uses less digits than its factorization.
11112000020112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7467741991 (or 7467741985 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11112000020112 its reverse (21102000021111), we get a palindrome (32214000041223).
Subtracting 11112000020112 from its reverse (21102000021111), we obtain a palindrome (9990000000999).
The spelling of 11112000020112 in words is "eleven trillion, one hundred twelve billion, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •