Base | Representation |
---|---|
bin | 110100001100110111… |
… | …1110000100111100010 |
3 | 101201100111222220201200 |
4 | 1220121233300213202 |
5 | 3314040340200002 |
6 | 123255403342030 |
7 | 11045653425303 |
oct | 1503157604742 |
9 | 351314886650 |
10 | 112101100002 |
11 | 435a616a6a1 |
12 | 19886521916 |
13 | a7568b1648 |
14 | 55d62787aa |
15 | 2db17cab1c |
hex | 1a19bf09e2 |
112101100002 has 24 divisors (see below), whose sum is σ = 242898289920. Its totient is φ = 37365099000.
The previous prime is 112101099977. The next prime is 112101100003. The reversal of 112101100002 is 200001101211.
It is a happy number.
112101100002 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 not an unprimeable number, because it can be changed into a prime (112101100003) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 220627 + ... + 522377.
It is an arithmetic number, because the mean of its divisors is an integer number (10120762080).
Almost surely, 2112101100002 is an apocalyptic number.
112101100002 is an abundant number, since it is smaller than the sum of its proper divisors (130797189918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112101100002 is a wasteful number, since it uses less digits than its factorization.
112101100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322398 (or 322395 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112101100002 its reverse (200001101211), we get a palindrome (312102201213).
The spelling of 112101100002 in words is "one hundred twelve billion, one hundred one million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •