Base | Representation |
---|---|
bin | 11001010001000001101100… |
… | …010100100001101001000000 |
3 | 112120110002021021020021001001 |
4 | 121101001230110201221000 |
5 | 104031102220031431422 |
6 | 1032200214003021344 |
7 | 32256146126503516 |
oct | 3121015424415100 |
9 | 476402237207031 |
10 | 111121211202112 |
11 | 32452271888291 |
12 | 1056805096a854 |
13 | 4a008ba66b5a7 |
14 | 1d6241c4d84b6 |
15 | cca7b742e227 |
hex | 65106c521a40 |
111121211202112 has 28 divisors (see below), whose sum is σ = 220768973792640. Its totient is φ = 55494383159936.
The previous prime is 111121211202083. The next prime is 111121211202119. The reversal of 111121211202112 is 211202112121111.
It is a super-2 number, since 2×1111212112021122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111121211202112.
It is not an unprimeable number, because it can be changed into a prime (111121211202119) 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, 1034671528 + ... + 1034778919.
It is an arithmetic number, because the mean of its divisors is an integer number (7884606206880).
Almost surely, 2111121211202112 is an apocalyptic number.
It is an amenable number.
111121211202112 is a deficient number, since it is larger than the sum of its proper divisors (109647762590528).
111121211202112 is an equidigital number, since it uses as much as digits as its factorization.
111121211202112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2069451298 (or 2069451288 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 111121211202112 its reverse (211202112121111), we get a palindrome (322323323323223).
The spelling of 111121211202112 in words is "one hundred eleven trillion, one hundred twenty-one billion, two hundred eleven million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •