Base | Representation |
---|---|
bin | 110100001011011001… |
… | …0100011010110010111 |
3 | 101201020001122222220211 |
4 | 1220112302203112113 |
5 | 3313440141003224 |
6 | 123250432310251 |
7 | 11044512016204 |
oct | 1502662432627 |
9 | 351201588824 |
10 | 112051500439 |
11 | 4358017281a |
12 | 198719a2387 |
13 | a7495365a8 |
14 | 55cd846cab |
15 | 2dac27e894 |
hex | 1a16ca3597 |
112051500439 has 4 divisors (see below), whose sum is σ = 112217996656. Its totient is φ = 111885004224.
The previous prime is 112051500401. The next prime is 112051500559. The reversal of 112051500439 is 934005150211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 934005150211 = 7 ⋅133429307173.
It is a cyclic number.
It is not a de Polignac number, because 112051500439 - 231 = 109904016791 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112051500439.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112051501439) 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 3 ways as a sum of consecutive naturals, for example, 83247099 + ... + 83248444.
It is an arithmetic number, because the mean of its divisors is an integer number (28054499164).
Almost surely, 2112051500439 is an apocalyptic number.
112051500439 is a deficient number, since it is larger than the sum of its proper divisors (166496217).
112051500439 is an equidigital number, since it uses as much as digits as its factorization.
112051500439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166496216.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 112051500439 in words is "one hundred twelve billion, fifty-one million, five hundred thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •