Base | Representation |
---|---|
bin | 110100100000001101… |
… | …1011100010110101111 |
3 | 101210000202011210112111 |
4 | 1221000123130112233 |
5 | 3321403010214201 |
6 | 123444025344451 |
7 | 11101023625405 |
oct | 1510033342657 |
9 | 353022153474 |
10 | 112750085551 |
11 | 438a9536094 |
12 | 19a27938127 |
13 | a82b19b96c |
14 | 5658533475 |
15 | 2ded772b51 |
hex | 1a406dc5af |
112750085551 has 8 divisors (see below), whose sum is σ = 118797462000. Its totient is φ = 106714025280.
The previous prime is 112750085537. The next prime is 112750085573. The reversal of 112750085551 is 155580057211.
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 112750085551 - 213 = 112750077359 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112750085521) 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, 2808580 + ... + 2848441.
It is an arithmetic number, because the mean of its divisors is an integer number (14849682750).
Almost surely, 2112750085551 is an apocalyptic number.
112750085551 is a deficient number, since it is larger than the sum of its proper divisors (6047376449).
112750085551 is a wasteful number, since it uses less digits than its factorization.
112750085551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5658089.
The product of its (nonzero) digits is 70000, while the sum is 40.
The spelling of 112750085551 in words is "one hundred twelve billion, seven hundred fifty million, eighty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •