Base | Representation |
---|---|
bin | 110100001101001101… |
… | …0001001010101101110 |
3 | 101201101021220102120121 |
4 | 1220122122021111232 |
5 | 3314101211230220 |
6 | 123300441435154 |
7 | 11046150033631 |
oct | 1503232112556 |
9 | 351337812517 |
10 | 112112211310 |
11 | 436014697a0 |
12 | 1988a19baba |
13 | a758ca1c98 |
14 | 55d792bc18 |
15 | 2db2772eaa |
hex | 1a1a68956e |
112112211310 has 64 divisors (see below), whose sum is σ = 229793863680. Its totient is φ = 38982887680.
The previous prime is 112112211307. The next prime is 112112211311. The reversal of 112112211310 is 13112211211.
It is a happy number.
It is a super-2 number, since 2×1121122113102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112112211311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11286426 + ... + 11296354.
It is an arithmetic number, because the mean of its divisors is an integer number (3590529120).
Almost surely, 2112112211310 is an apocalyptic number.
112112211310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112112211310 is an abundant number, since it is smaller than the sum of its proper divisors (117681652370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112112211310 is a wasteful number, since it uses less digits than its factorization.
112112211310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14433.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 112112211310 its reverse (13112211211), we get a palindrome (125224422521).
Subtracting from 112112211310 its reverse (13112211211), we obtain a palindrome (99000000099).
The spelling of 112112211310 in words is "one hundred twelve billion, one hundred twelve million, two hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •