Base | Representation |
---|---|
bin | 110100010110001110… |
… | …1101100011110000000 |
3 | 101202011101220100222122 |
4 | 1220230131230132000 |
5 | 3320211233202040 |
6 | 123350502223412 |
7 | 11056515565136 |
oct | 1505435543600 |
9 | 352141810878 |
10 | 112415131520 |
11 | 4374745817a |
12 | 19953724b68 |
13 | a7a6983003 |
14 | 5625c61756 |
15 | 2dce15c1b5 |
hex | 1a2c76c780 |
112415131520 has 32 divisors (see below), whose sum is σ = 268742425320. Its totient is φ = 44966052352.
The previous prime is 112415131519. The next prime is 112415131531. The reversal of 112415131520 is 25131514211.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 112415131520.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87823682 + ... + 87824961.
Almost surely, 2112415131520 is an apocalyptic number.
112415131520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112415131520 is an abundant number, since it is smaller than the sum of its proper divisors (156327293800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112415131520 is an equidigital number, since it uses as much as digits as its factorization.
112415131520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175648662 (or 175648650 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 112415131520 its reverse (25131514211), we get a palindrome (137546645731).
The spelling of 112415131520 in words is "one hundred twelve billion, four hundred fifteen million, one hundred thirty-one thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •