Base | Representation |
---|---|
bin | 110100010111011011… |
… | …0111110011011010000 |
3 | 101202021012111210202110 |
4 | 1220232312332123100 |
5 | 3320302030004404 |
6 | 123354455345320 |
7 | 11060514250461 |
oct | 1505666763320 |
9 | 352235453673 |
10 | 112455313104 |
11 | 437681021a2 |
12 | 19965082240 |
13 | a7b20b13b4 |
14 | 562b320d68 |
15 | 2dd2947b89 |
hex | 1a2edbe6d0 |
112455313104 has 80 divisors (see below), whose sum is σ = 299173708800. Its totient is φ = 36383238528.
The previous prime is 112455313073. The next prime is 112455313111. The reversal of 112455313104 is 401313554211.
It is a super-2 number, since 2×1124553131042 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27594 + ... + 475049.
It is an arithmetic number, because the mean of its divisors is an integer number (3739671360).
Almost surely, 2112455313104 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112455313104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149586854400).
112455313104 is an abundant number, since it is smaller than the sum of its proper divisors (186718395696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112455313104 is a wasteful number, since it uses less digits than its factorization.
112455313104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502792 (or 502786 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 112455313104 its reverse (401313554211), we get a palindrome (513768867315).
The spelling of 112455313104 in words is "one hundred twelve billion, four hundred fifty-five million, three hundred thirteen thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •