Base | Representation |
---|---|
bin | 110100001101001000… |
… | …1110100110011000100 |
3 | 101201101010210121102002 |
4 | 1220122101310303010 |
5 | 3314100131430040 |
6 | 123300323004432 |
7 | 11046122350322 |
oct | 1503221646304 |
9 | 351333717362 |
10 | 112110030020 |
11 | 4360020997a |
12 | 19889509718 |
13 | a7586ba191 |
14 | 55d7520d12 |
15 | 2db2491a15 |
hex | 1a1a474cc4 |
112110030020 has 24 divisors (see below), whose sum is σ = 236109553344. Its totient is φ = 44714775776.
The previous prime is 112110030001. The next prime is 112110030023. The reversal of 112110030020 is 20030011211.
It is a super-3 number, since 3×1121100300203 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112110029983 and 112110030010.
It is not an unprimeable number, because it can be changed into a prime (112110030023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8070152 + ... + 8084031.
It is an arithmetic number, because the mean of its divisors is an integer number (9837898056).
Almost surely, 2112110030020 is an apocalyptic number.
112110030020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112110030020 is an abundant number, since it is smaller than the sum of its proper divisors (123999523324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110030020 is a wasteful number, since it uses less digits than its factorization.
112110030020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16154539 (or 16154537 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 112110030020 its reverse (20030011211), we get a palindrome (132140041231).
The spelling of 112110030020 in words is "one hundred twelve billion, one hundred ten million, thirty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •