Base | Representation |
---|---|
bin | 110100001101001010… |
… | …1111111011001100100 |
3 | 101201101012212002100112 |
4 | 1220122111333121210 |
5 | 3314100421401040 |
6 | 123300402232152 |
7 | 11046134546102 |
oct | 1503225773144 |
9 | 351335762315 |
10 | 112111122020 |
11 | 43600895357 |
12 | 19889955658 |
13 | a7589b0231 |
14 | 55d7726c72 |
15 | 2db260a365 |
hex | 1a1a57f664 |
112111122020 has 12 divisors (see below), whose sum is σ = 235433356284. Its totient is φ = 44844448800.
The previous prime is 112111121959. The next prime is 112111122061. The reversal of 112111122020 is 20221111211.
It can be written as a sum of positive squares in 2 ways, for example, as 11576468836 + 100534653184 = 107594^2 + 317072^2 .
It is a junction number, because it is equal to n+sod(n) for n = 112111121986 and 112111122004.
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, 2802778031 + ... + 2802778070.
It is an arithmetic number, because the mean of its divisors is an integer number (19619446357).
Almost surely, 2112111122020 is an apocalyptic number.
112111122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112111122020 is an abundant number, since it is smaller than the sum of its proper divisors (123322234264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112111122020 is a wasteful number, since it uses less digits than its factorization.
112111122020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5605556110 (or 5605556108 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112111122020 its reverse (20221111211), we get a palindrome (132332233231).
The spelling of 112111122020 in words is "one hundred twelve billion, one hundred eleven million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •