Base | Representation |
---|---|
bin | 110100001100110101… |
… | …1100110111111101010 |
3 | 101201100102221122021200 |
4 | 1220121223212333222 |
5 | 3314040100341020 |
6 | 123255324145030 |
7 | 11045641244310 |
oct | 1503153467752 |
9 | 351312848250 |
10 | 112100012010 |
11 | 435a5597228 |
12 | 19886098176 |
13 | a7565c036c |
14 | 55d60740b0 |
15 | 2db1663590 |
hex | 1a19ae6fea |
112100012010 has 48 divisors (see below), whose sum is σ = 333097180416. Its totient is φ = 25622859744.
The previous prime is 112100011943. The next prime is 112100012047. The reversal of 112100012010 is 10210001211.
It is a happy number.
112100012010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 = 112100011983 and 112100012001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 88967634 + ... + 88968893.
It is an arithmetic number, because the mean of its divisors is an integer number (6939524592).
Almost surely, 2112100012010 is an apocalyptic number.
112100012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112100012010 is an abundant number, since it is smaller than the sum of its proper divisors (220997168406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112100012010 is a wasteful number, since it uses less digits than its factorization.
112100012010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177936547 (or 177936544 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112100012010 its reverse (10210001211), we get a palindrome (122310013221).
The spelling of 112100012010 in words is "one hundred twelve billion, one hundred million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •