Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0110100011000000001 |
3 | 101201010020211112010000 |
4 | 1220110120310120001 |
5 | 3313344331400001 |
6 | 123242432430213 |
7 | 11043512330211 |
oct | 1502430643001 |
9 | 351106745100 |
10 | 112011200001 |
11 | 4355a447478 |
12 | 198603a8369 |
13 | a74109608c |
14 | 55c8356241 |
15 | 2da896da86 |
hex | 1a14634601 |
112011200001 has 40 divisors (see below), whose sum is σ = 169325604360. Its totient is φ = 73782669312.
The previous prime is 112011199981. The next prime is 112011200039. The reversal of 112011200001 is 100002110211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 906311025 + 111104888976 = 30105^2 + 333324^2 .
It is not a de Polignac number, because 112011200001 - 27 = 112011199873 is a prime.
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 (112011200201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 11940625 + ... + 11950001.
It is an arithmetic number, because the mean of its divisors is an integer number (4233140109).
Almost surely, 2112011200001 is an apocalyptic number.
It is an amenable number.
112011200001 is a deficient number, since it is larger than the sum of its proper divisors (57314404359).
112011200001 is an equidigital number, since it uses as much as digits as its factorization.
112011200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11135 (or 11126 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112011200001 its reverse (100002110211), we get a palindrome (212013310212).
The spelling of 112011200001 in words is "one hundred twelve billion, eleven million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •