Base | Representation |
---|---|
bin | 110100001010001111… |
… | …1110011011110000100 |
3 | 101201010101021120011220 |
4 | 1220110133303132010 |
5 | 3313400314000200 |
6 | 123242540000340 |
7 | 11043534025242 |
oct | 1502437633604 |
9 | 351111246156 |
10 | 112013031300 |
11 | 43560488345 |
12 | 19860b300b0 |
13 | a7415877a1 |
14 | 55c86b1792 |
15 | 2da8bd14a0 |
hex | 1a147f3784 |
112013031300 has 72 divisors (see below), whose sum is σ = 341148477600. Its totient is φ = 28298027520.
The previous prime is 112013031289. The next prime is 112013031353. The reversal of 112013031300 is 3130310211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 112013031300.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 9820005 + ... + 9831404.
It is an arithmetic number, because the mean of its divisors is an integer number (4738173300).
Almost surely, 2112013031300 is an apocalyptic number.
112013031300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112013031300 is an abundant number, since it is smaller than the sum of its proper divisors (229135446300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112013031300 is a wasteful number, since it uses less digits than its factorization.
112013031300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19651445 (or 19651438 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 112013031300 its reverse (3130310211), we get a palindrome (115143341511).
The spelling of 112013031300 in words is "one hundred twelve billion, thirteen million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •