Base | Representation |
---|---|
bin | 110100010010110101… |
… | …0011001001111001110 |
3 | 101201212110011220120010 |
4 | 1220211222121033032 |
5 | 3314443030120420 |
6 | 123331304334050 |
7 | 11053631630616 |
oct | 1504552311716 |
9 | 351773156503 |
10 | 112301020110 |
11 | 43698aa8624 |
12 | 19921474326 |
13 | a78913b476 |
14 | 5614a39a46 |
15 | 2dc411b4e0 |
hex | 1a25a993ce |
112301020110 has 32 divisors (see below), whose sum is σ = 270256868352. Its totient is φ = 29865336480.
The previous prime is 112301020099. The next prime is 112301020121. The reversal of 112301020110 is 11020103211.
It is an interprime number because it is at equal distance from previous prime (112301020099) and next prime (112301020121).
It is a super-2 number, since 2×1123010201102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 5088946 + ... + 5110965.
It is an arithmetic number, because the mean of its divisors is an integer number (8445527136).
Almost surely, 2112301020110 is an apocalyptic number.
112301020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112301020110 is an abundant number, since it is smaller than the sum of its proper divisors (157955848242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112301020110 is a wasteful number, since it uses less digits than its factorization.
112301020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10200288.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 112301020110 its reverse (11020103211), we get a palindrome (123321123321).
The spelling of 112301020110 in words is "one hundred twelve billion, three hundred one million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •