Base | Representation |
---|---|
bin | 110011110010000001… |
… | …1001011001101100001 |
3 | 101122000201211110200201 |
4 | 1213210003023031201 |
5 | 3310214224020001 |
6 | 123030142345201 |
7 | 11014434163063 |
oct | 1474403131541 |
9 | 348021743621 |
10 | 111200220001 |
11 | 43183697172 |
12 | 1967488b201 |
13 | a64206a560 |
14 | 554c76d733 |
15 | 2d5c678501 |
hex | 19e40cb361 |
111200220001 has 16 divisors (see below), whose sum is σ = 123742302208. Its totient is φ = 99234590400.
The previous prime is 111200219909. The next prime is 111200220007. The reversal of 111200220001 is 100022002111.
It is a cyclic number.
It is not a de Polignac number, because 111200220001 - 213 = 111200211809 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111200220001.
It is not an unprimeable number, because it can be changed into a prime (111200220007) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 260155 + ... + 538591.
It is an arithmetic number, because the mean of its divisors is an integer number (7733893888).
Almost surely, 2111200220001 is an apocalyptic number.
It is an amenable number.
111200220001 is a deficient number, since it is larger than the sum of its proper divisors (12542082207).
111200220001 is a wasteful number, since it uses less digits than its factorization.
111200220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279472.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 111200220001 its reverse (100022002111), we get a palindrome (211222222112).
The spelling of 111200220001 in words is "one hundred eleven billion, two hundred million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •