Base | Representation |
---|---|
bin | 110100001111111010… |
… | …0111001011011110011 |
3 | 101201121121221120022121 |
4 | 1220133310321123303 |
5 | 3314242444011011 |
6 | 123313450015111 |
7 | 11051332462030 |
oct | 1503764713363 |
9 | 351547846277 |
10 | 112203110131 |
11 | 43648804392 |
12 | 198b4717497 |
13 | a771a7a078 |
14 | 5605a30387 |
15 | 2dba72ae71 |
hex | 1a1fd396f3 |
112203110131 has 8 divisors (see below), whose sum is σ = 134981185280. Its totient is φ = 91112299848.
The previous prime is 112203110119. The next prime is 112203110179. The reversal of 112203110131 is 131011302211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112203110131 - 217 = 112202979059 is a prime.
It is a super-2 number, since 2×1122031101312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112203110191) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 421816071 + ... + 421816336.
It is an arithmetic number, because the mean of its divisors is an integer number (16872648160).
Almost surely, 2112203110131 is an apocalyptic number.
112203110131 is a deficient number, since it is larger than the sum of its proper divisors (22778075149).
112203110131 is an equidigital number, since it uses as much as digits as its factorization.
112203110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843632433.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 112203110131 its reverse (131011302211), we get a palindrome (243214412342).
The spelling of 112203110131 in words is "one hundred twelve billion, two hundred three million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.325 sec. • engine limits •