Base | Representation |
---|---|
bin | 110100001010011101… |
… | …0011011011111111001 |
3 | 101201010212102011112100 |
4 | 1220110322123133321 |
5 | 3313404110323001 |
6 | 123243345334013 |
7 | 11043650245233 |
oct | 1502472333771 |
9 | 351125364470 |
10 | 112020011001 |
11 | 43564415298 |
12 | 19863337309 |
13 | a742b5c6a2 |
14 | 55c95ab253 |
15 | 2da960e586 |
hex | 1a14e9b7f9 |
112020011001 has 24 divisors (see below), whose sum is σ = 163858972680. Its totient is φ = 73735200000.
The previous prime is 112020010997. The next prime is 112020011009. The reversal of 112020011001 is 100110020211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 765075600 + 111254935401 = 27660^2 + 333549^2 .
It is not a de Polignac number, because 112020011001 - 22 = 112020010997 is a prime.
It is a super-2 number, since 2×1120200110012 (a number of 23 digits) contains 22 as substring.
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 (112020011009) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 461751 + ... + 661251.
It is an arithmetic number, because the mean of its divisors is an integer number (6827457195).
Almost surely, 2112020011001 is an apocalyptic number.
It is an amenable number.
112020011001 is a deficient number, since it is larger than the sum of its proper divisors (51838961679).
112020011001 is a wasteful number, since it uses less digits than its factorization.
112020011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200297 (or 200294 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112020011001 its reverse (100110020211), we get a palindrome (212130031212).
The spelling of 112020011001 in words is "one hundred twelve billion, twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •