Base | Representation |
---|---|
bin | 110100001010010000… |
… | …0100000100100010100 |
3 | 101201010101121221120101 |
4 | 1220110200200210110 |
5 | 3313400340403040 |
6 | 123242543543444 |
7 | 11043535424626 |
oct | 1502440404424 |
9 | 351111557511 |
10 | 112013216020 |
11 | 435605a4102 |
12 | 19860bbab84 |
13 | a7416208a4 |
14 | 55c871cc16 |
15 | 2da8c1b09a |
hex | 1a14820914 |
112013216020 has 12 divisors (see below), whose sum is σ = 235227753684. Its totient is φ = 44805286400.
The previous prime is 112013215997. The next prime is 112013216111. The reversal of 112013216020 is 20612310211.
It can be written as a sum of positive squares in 2 ways, for example, as 56133929476 + 55879286544 = 236926^2 + 236388^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2800330381 + ... + 2800330420.
It is an arithmetic number, because the mean of its divisors is an integer number (19602312807).
Almost surely, 2112013216020 is an apocalyptic number.
112013216020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112013216020 is an abundant number, since it is smaller than the sum of its proper divisors (123214537664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112013216020 is a wasteful number, since it uses less digits than its factorization.
112013216020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5600660810 (or 5600660808 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 112013216020 its reverse (20612310211), we get a palindrome (132625526231).
The spelling of 112013216020 in words is "one hundred twelve billion, thirteen million, two hundred sixteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •