Base | Representation |
---|---|
bin | 110100011001011111… |
… | …1000100110001110000 |
3 | 101202110000210011020210 |
4 | 1220302333010301300 |
5 | 3320422240421021 |
6 | 123405411304120 |
7 | 11062314565233 |
oct | 1506277046160 |
9 | 352400704223 |
10 | 112524545136 |
11 | 437a3199253 |
12 | 199842ab040 |
13 | a7c35414b3 |
14 | 56365c341a |
15 | 2dd8a70e76 |
hex | 1a32fc4c70 |
112524545136 has 80 divisors (see below), whose sum is σ = 295382157824. Its totient is φ = 36907183872.
The previous prime is 112524545117. The next prime is 112524545137. The reversal of 112524545136 is 631545425211.
It is a junction number, because it is equal to n+sod(n) for n = 112524545094 and 112524545103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112524545137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 703725 + ... + 848691.
Almost surely, 2112524545136 is an apocalyptic number.
112524545136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112524545136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147691078912).
112524545136 is an abundant number, since it is smaller than the sum of its proper divisors (182857612688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112524545136 is a wasteful number, since it uses less digits than its factorization.
112524545136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145238 (or 145232 counting only the distinct ones).
The product of its digits is 144000, while the sum is 39.
The spelling of 112524545136 in words is "one hundred twelve billion, five hundred twenty-four million, five hundred forty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •