Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0100011110100000000 |
3 | 101201002110222201002211 |
4 | 1220103232203310000 |
5 | 3313334012401422 |
6 | 123241355151504 |
7 | 11043316221154 |
oct | 1502356436400 |
9 | 351073881084 |
10 | 112000122112 |
11 | 4355417049a |
12 | 19858745594 |
13 | a73b9b7a08 |
14 | 55c6ab1064 |
15 | 2da79d1577 |
hex | 1a13ba3d00 |
112000122112 has 36 divisors (see below), whose sum is σ = 224226307396. Its totient is φ = 55833845760.
The previous prime is 112000122067. The next prime is 112000122193. The reversal of 112000122112 is 211221000211.
112000122112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 82520605696 + 29479516416 = 287264^2 + 171696^2 .
It is a super-2 number, since 2×1120001221122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112000122092 and 112000122101.
It is a congruent number.
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, 562839 + ... + 735382.
Almost surely, 2112000122112 is an apocalyptic number.
It is an amenable number.
112000122112 is an abundant number, since it is smaller than the sum of its proper divisors (112226185284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112000122112 is an equidigital number, since it uses as much as digits as its factorization.
112000122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1298574 (or 1298560 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112000122112 its reverse (211221000211), we get a palindrome (323221122323).
The spelling of 112000122112 in words is "one hundred twelve billion, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •