Base | Representation |
---|---|
bin | 110100001010001111… |
… | …1101110010001100101 |
3 | 101201010101020110222210 |
4 | 1220110133232101211 |
5 | 3313400312310041 |
6 | 123242535314033 |
7 | 11043533606223 |
oct | 1502437562145 |
9 | 351111213883 |
10 | 112013010021 |
11 | 43560473360 |
12 | 19860b1b919 |
13 | a74157abb3 |
14 | 55c86a7b13 |
15 | 2da8bca016 |
hex | 1a147ee465 |
112013010021 has 16 divisors (see below), whose sum is σ = 163193832000. Its totient is φ = 67775915520.
The previous prime is 112013010017. The next prime is 112013010041. The reversal of 112013010021 is 120010310211.
It is not a de Polignac number, because 112013010021 - 22 = 112013010017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112013009979 and 112013010006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112013010041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2748396 + ... + 2788853.
It is an arithmetic number, because the mean of its divisors is an integer number (10199614500).
Almost surely, 2112013010021 is an apocalyptic number.
112013010021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112013010021 is a deficient number, since it is larger than the sum of its proper divisors (51180821979).
112013010021 is a wasteful number, since it uses less digits than its factorization.
112013010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5537876.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 112013010021 its reverse (120010310211), we get a palindrome (232023320232).
The spelling of 112013010021 in words is "one hundred twelve billion, thirteen million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •