Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0001000011100010100 |
3 | 101201002110210000022200 |
4 | 1220103232020130110 |
5 | 3313334000310004 |
6 | 123241352524500 |
7 | 11043315243261 |
oct | 1502356103424 |
9 | 351073700280 |
10 | 112000010004 |
11 | 435540a4243 |
12 | 198586b0730 |
13 | a73b97898c |
14 | 55c6a82268 |
15 | 2da79ad239 |
hex | 1a13b88714 |
112000010004 has 36 divisors (see below), whose sum is σ = 284015673396. Its totient is φ = 37214057088.
The previous prime is 112000009997. The next prime is 112000010021. The reversal of 112000010004 is 400010000211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 33598890000 + 78401120004 = 183300^2 + 280002^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1120000100042 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4958559 + ... + 4981094.
It is an arithmetic number, because the mean of its divisors is an integer number (7889324261).
Almost surely, 2112000010004 is an apocalyptic number.
It is an amenable number.
112000010004 is an abundant number, since it is smaller than the sum of its proper divisors (172015663392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112000010004 is a wasteful number, since it uses less digits than its factorization.
112000010004 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9939976 (or 9939971 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 112000010004 its reverse (400010000211), we get a palindrome (512010010215).
The spelling of 112000010004 in words is "one hundred twelve billion, ten thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.408 sec. • engine limits •