Base | Representation |
---|---|
bin | 110100001100111001… |
… | …1111111100111100100 |
3 | 101201100121002022101110 |
4 | 1220121303333213210 |
5 | 3314041131210040 |
6 | 123255443225020 |
7 | 11045666030433 |
oct | 1503163774744 |
9 | 351317068343 |
10 | 112102210020 |
11 | 435a6858669 |
12 | 19886978170 |
13 | a756bac968 |
14 | 55d648711a |
15 | 2db1949980 |
hex | 1a19cff9e4 |
112102210020 has 96 divisors (see below), whose sum is σ = 329866846848. Its totient is φ = 28409536512.
The previous prime is 112102209979. The next prime is 112102210069. The reversal of 112102210020 is 20012201211.
It is a super-3 number, since 3×1121022100203 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 112102209978 and 112102210005.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 491709 + ... + 682628.
It is an arithmetic number, because the mean of its divisors is an integer number (3436112988).
Almost surely, 2112102210020 is an apocalyptic number.
112102210020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112102210020 is an abundant number, since it is smaller than the sum of its proper divisors (217764636828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112102210020 is a wasteful number, since it uses less digits than its factorization.
112102210020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1174429 (or 1174427 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 112102210020 its reverse (20012201211), we get a palindrome (132114411231).
The spelling of 112102210020 in words is "one hundred twelve billion, one hundred two million, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •