Base | Representation |
---|---|
bin | 110100001111111000… |
… | …1100000001001100011 |
3 | 101201121120021100110122 |
4 | 1220133301200021203 |
5 | 3314242232021011 |
6 | 123313414550455 |
7 | 11051322064211 |
oct | 1503761401143 |
9 | 351546240418 |
10 | 112202220131 |
11 | 43648256751 |
12 | 198b436842b |
13 | a771827c41 |
14 | 560587bcb1 |
15 | 2dba6023db |
hex | 1a1fc60263 |
112202220131 has 4 divisors (see below), whose sum is σ = 117080577552. Its totient is φ = 107323862712.
The previous prime is 112202220083. The next prime is 112202220253. The reversal of 112202220131 is 131022202211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112202220131 is a prime.
It is a super-2 number, since 2×1122022201312 (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 (112202280131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2439178676 + ... + 2439178721.
It is an arithmetic number, because the mean of its divisors is an integer number (29270144388).
Almost surely, 2112202220131 is an apocalyptic number.
112202220131 is a deficient number, since it is larger than the sum of its proper divisors (4878357421).
112202220131 is an equidigital number, since it uses as much as digits as its factorization.
112202220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4878357420.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 112202220131 its reverse (131022202211), we get a palindrome (243224422342).
The spelling of 112202220131 in words is "one hundred twelve billion, two hundred two million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •