Base | Representation |
---|---|
bin | 110100001010011101… |
… | …1001001101001001010 |
3 | 101201010212202202210200 |
4 | 1220110323021221022 |
5 | 3313404132400020 |
6 | 123243353353030 |
7 | 11043651663255 |
oct | 1502473115112 |
9 | 351125682720 |
10 | 112020200010 |
11 | 435645342a4 |
12 | 19863408776 |
13 | a742bc7724 |
14 | 55c961a09c |
15 | 2da964a590 |
hex | 1a14ec9a4a |
112020200010 has 48 divisors (see below), whose sum is σ = 308385025416. Its totient is φ = 28114873344.
The previous prime is 112020200003. The next prime is 112020200023. The reversal of 112020200010 is 10002020211.
It can be written as a sum of positive squares in 4 ways, for example, as 95720315769 + 16299884241 = 309387^2 + 127671^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 112020199965 and 112020200001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36606379 + ... + 36609438.
Almost surely, 2112020200010 is an apocalyptic number.
112020200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112020200010 is an abundant number, since it is smaller than the sum of its proper divisors (196364825406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112020200010 is a wasteful number, since it uses less digits than its factorization.
112020200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73215847 (or 73215844 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 112020200010 its reverse (10002020211), we get a palindrome (122022220221).
The spelling of 112020200010 in words is "one hundred twelve billion, twenty million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •