Base | Representation |
---|---|
bin | 110100100011101001… |
… | …1001011111011101100 |
3 | 101210022210002102121102 |
4 | 1221013103023323230 |
5 | 3322122013033034 |
6 | 123503304222232 |
7 | 11103623513330 |
oct | 1510723137354 |
9 | 353283072542 |
10 | 112865361644 |
11 | 43958610792 |
12 | 19a5a46a978 |
13 | a849030679 |
14 | 566997d7c0 |
15 | 2e0894397e |
hex | 1a474cbeec |
112865361644 has 12 divisors (see below), whose sum is σ = 225730723344. Its totient is φ = 48370869264.
The previous prime is 112865361619. The next prime is 112865361671. The reversal of 112865361644 is 446163568211.
112865361644 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
112865361644 is an admirable number.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2015452859 + ... + 2015452914.
It is an arithmetic number, because the mean of its divisors is an integer number (18810893612).
Almost surely, 2112865361644 is an apocalyptic number.
112865361644 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
112865361644 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112865361644 is a wasteful number, since it uses less digits than its factorization.
112865361644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4030905784 (or 4030905782 counting only the distinct ones).
The product of its digits is 829440, while the sum is 47.
The spelling of 112865361644 in words is "one hundred twelve billion, eight hundred sixty-five million, three hundred sixty-one thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •