Base | Representation |
---|---|
bin | 110100001101001010… |
… | …1100110011111110101 |
3 | 101201101012122220102210 |
4 | 1220122111212133311 |
5 | 3314100410120041 |
6 | 123300400124033 |
7 | 11046133642530 |
oct | 1503225463765 |
9 | 351335586383 |
10 | 112111020021 |
11 | 43600825760 |
12 | 19889906619 |
13 | a758975990 |
14 | 55d76dba17 |
15 | 2db25da016 |
hex | 1a1a5667f5 |
112111020021 has 64 divisors (see below), whose sum is σ = 203529424896. Its totient is φ = 53002252800.
The previous prime is 112111019987. The next prime is 112111020029. The reversal of 112111020021 is 120020111211.
It is not a de Polignac number, because 112111020021 - 211 = 112111017973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112111019979 and 112111020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112111020029) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 49696 + ... + 476121.
It is an arithmetic number, because the mean of its divisors is an integer number (3180147264).
Almost surely, 2112111020021 is an apocalyptic number.
112111020021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112111020021 is a deficient number, since it is larger than the sum of its proper divisors (91418404875).
112111020021 is a wasteful number, since it uses less digits than its factorization.
112111020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525922.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112111020021 its reverse (120020111211), we get a palindrome (232131131232).
The spelling of 112111020021 in words is "one hundred twelve billion, one hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •