Base | Representation |
---|---|
bin | 10100101100101011… |
… | …10000100110111000 |
3 | 1001200102121022122220 |
4 | 22112111300212320 |
5 | 140224212033422 |
6 | 5034353244040 |
7 | 542241215046 |
oct | 122625604670 |
9 | 31612538586 |
10 | 11112221112 |
11 | 4792617213 |
12 | 21a1563620 |
13 | 1081259985 |
14 | 775b63396 |
15 | 450859e5c |
hex | 2965709b8 |
11112221112 has 16 divisors (see below), whose sum is σ = 27780552840. Its totient is φ = 3704073696.
The previous prime is 11112221089. The next prime is 11112221119. The reversal of 11112221112 is 21112221111.
It is a happy number.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 11112221091 and 11112221100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112221119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231504583 + ... + 231504630.
Almost surely, 211112221112 is an apocalyptic number.
11112221112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11112221112 is an abundant number, since it is smaller than the sum of its proper divisors (16668331728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112221112 is a wasteful number, since it uses less digits than its factorization.
11112221112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 463009222 (or 463009218 counting only the distinct ones).
The product of its digits is 16, while the sum is 15.
Adding to 11112221112 its reverse (21112221111), we get a palindrome (32224442223).
Subtracting 11112221112 from its reverse (21112221111), we obtain a palindrome (9999999999).
The spelling of 11112221112 in words is "eleven billion, one hundred twelve million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •