Base | Representation |
---|---|
bin | 110100001110000011… |
… | …0000001000101110000 |
3 | 101201110021010002101010 |
4 | 1220130012001011300 |
5 | 3314130431122242 |
6 | 123303331510520 |
7 | 11046642300243 |
oct | 1503406010560 |
9 | 351407102333 |
10 | 112140489072 |
11 | 43616423247 |
12 | 19897758440 |
13 | a761ac30a1 |
14 | 55db5ad25a |
15 | 2db4eab89c |
hex | 1a1c181170 |
112140489072 has 40 divisors (see below), whose sum is σ = 292564555920. Its totient is φ = 37010060800.
The previous prime is 112140489047. The next prime is 112140489089. The reversal of 112140489072 is 270984041211.
It is a self number, because there is not a number n which added to its sum of digits gives 112140489072.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11560797 + ... + 11570492.
It is an arithmetic number, because the mean of its divisors is an integer number (7314113898).
Almost surely, 2112140489072 is an apocalyptic number.
112140489072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112140489072 is an abundant number, since it is smaller than the sum of its proper divisors (180424066848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112140489072 is a wasteful number, since it uses less digits than its factorization.
112140489072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23131401 (or 23131395 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 39.
The spelling of 112140489072 in words is "one hundred twelve billion, one hundred forty million, four hundred eighty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •