Base | Representation |
---|---|
bin | 11001010010010101011010… |
… | …110101010001101111001100 |
3 | 112120202200022121122121210010 |
4 | 121102111122311101233030 |
5 | 104034040324200023202 |
6 | 1032305402443313220 |
7 | 32265511013562042 |
oct | 3122253265215714 |
9 | 476680277577703 |
10 | 111211112111052 |
11 | 32487405578838 |
12 | 1058156051b810 |
13 | 4a09216aa79b5 |
14 | 1d6690a1a0392 |
15 | ccccc9c3576c |
hex | 65255ad51bcc |
111211112111052 has 24 divisors (see below), whose sum is σ = 259517236052032. Its totient is φ = 37066850542800.
The previous prime is 111211112111051. The next prime is 111211112111101. The reversal of 111211112111052 is 250111211112111.
It is a super-2 number, since 2×1112111121110522 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111211112111051) 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, 439888474 + ... + 440141217.
Almost surely, 2111211112111052 is an apocalyptic number.
111211112111052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111211112111052 is an abundant number, since it is smaller than the sum of its proper divisors (148306123940980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111211112111052 is a wasteful number, since it uses less digits than its factorization.
111211112111052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 880040229 (or 880040227 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 21.
Adding to 111211112111052 its reverse (250111211112111), we get a palindrome (361322323223163).
The spelling of 111211112111052 in words is "one hundred eleven trillion, two hundred eleven billion, one hundred twelve million, one hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •