Base | Representation |
---|---|
bin | 10000001011101110111… |
… | …111001011100010011110 |
3 | 10221022112221020111112011 |
4 | 100023232333023202132 |
5 | 121210100420231420 |
6 | 2210521412301434 |
7 | 143230102253101 |
oct | 20135677134236 |
9 | 3838487214464 |
10 | 1112111102110 |
11 | 3997097a7298 |
12 | 15b64b91187a |
13 | 80b43c6c998 |
14 | 3bb7db66738 |
15 | 1ddddd6a95a |
hex | 102eefcb89e |
1112111102110 has 32 divisors (see below), whose sum is σ = 2008595698560. Its totient is φ = 443335596192.
The previous prime is 1112111102087. The next prime is 1112111102143. The reversal of 1112111102110 is 112011112111.
It is a super-2 number, since 2×11121111021102 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6786157 + ... + 6948103.
It is an arithmetic number, because the mean of its divisors is an integer number (62768615580).
Almost surely, 21112111102110 is an apocalyptic number.
1112111102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1112111102110 is a deficient number, since it is larger than the sum of its proper divisors (896484596450).
1112111102110 is a wasteful number, since it uses less digits than its factorization.
1112111102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164280.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1112111102110 its reverse (112011112111), we get a palindrome (1224122214221).
The spelling of 1112111102110 in words is "one trillion, one hundred twelve billion, one hundred eleven million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •