Base | Representation |
---|---|
bin | 110100001101110001… |
… | …1110110000110001011 |
3 | 101201102122020222102010 |
4 | 1220123203312012023 |
5 | 3314121132444042 |
6 | 123302411511003 |
7 | 11046503200656 |
oct | 1503343660613 |
9 | 351378228363 |
10 | 112131531147 |
11 | 43611364aa9 |
12 | 19894758463 |
13 | a75cca793c |
14 | 55da31a89d |
15 | 2db42dc59c |
hex | 1a1b8f618b |
112131531147 has 8 divisors (see below), whose sum is σ = 149727610944. Its totient is φ = 74644902728.
The previous prime is 112131531133. The next prime is 112131531179. The reversal of 112131531147 is 741135131211.
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 112131531147 - 219 = 112131006859 is a prime.
It is a super-3 number, since 3×1121315311473 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (112131531107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27360453 + ... + 27364550.
It is an arithmetic number, because the mean of its divisors is an integer number (18715951368).
Almost surely, 2112131531147 is an apocalyptic number.
112131531147 is a deficient number, since it is larger than the sum of its proper divisors (37596079797).
112131531147 is an equidigital number, since it uses as much as digits as its factorization.
112131531147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54725689.
The product of its digits is 2520, while the sum is 30.
Adding to 112131531147 its reverse (741135131211), we get a palindrome (853266662358).
The spelling of 112131531147 in words is "one hundred twelve billion, one hundred thirty-one million, five hundred thirty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •