Base | Representation |
---|---|
bin | 110100001001111010… |
… | …1101111000010111011 |
3 | 101201002121112021101012 |
4 | 1220103311233002323 |
5 | 3313340003100011 |
6 | 123241503344135 |
7 | 11043341214164 |
oct | 1502365570273 |
9 | 351077467335 |
10 | 112002003131 |
11 | 43555235757 |
12 | 198592b204b |
13 | a73c1c5c45 |
14 | 55c704076b |
15 | 2da7c53a8b |
hex | 1a13d6f0bb |
112002003131 has 8 divisors (see below), whose sum is σ = 115991352000. Its totient is φ = 108021135040.
The previous prime is 112002003119. The next prime is 112002003143. The reversal of 112002003131 is 131300200211.
It is an interprime number because it is at equal distance from previous prime (112002003119) and next prime (112002003143).
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 112002003131 - 26 = 112002003067 is a prime.
It is a super-2 number, since 2×1120020031312 (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 (112002003161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2093306 + ... + 2146143.
It is an arithmetic number, because the mean of its divisors is an integer number (14498919000).
Almost surely, 2112002003131 is an apocalyptic number.
112002003131 is a deficient number, since it is larger than the sum of its proper divisors (3989348869).
112002003131 is an equidigital number, since it uses as much as digits as its factorization.
112002003131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4240389.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 112002003131 its reverse (131300200211), we get a palindrome (243302203342).
The spelling of 112002003131 in words is "one hundred twelve billion, two million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •