Base | Representation |
---|---|
bin | 11001010000111001010011… |
… | …001101100001001000000001 |
3 | 112120102020000021001202121201 |
4 | 121100321103031201020001 |
5 | 104030430241200000001 |
6 | 1032152123501421201 |
7 | 32255406616525324 |
oct | 3120712315411001 |
9 | 476366007052551 |
10 | 111112200000001 |
11 | 32449468235812 |
12 | 10566356b6a801 |
13 | 49ccab2798535 |
14 | 1d61c058087bb |
15 | cca43b28d501 |
hex | 650e53361201 |
111112200000001 has 4 divisors (see below), whose sum is σ = 111140552185600. Its totient is φ = 111083847814404.
The previous prime is 111112199999971. The next prime is 111112200000029. The reversal of 111112200000001 is 100000002211111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111112200000001 - 219 = 111112199475713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111112200000301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14176086921 + ... + 14176094758.
It is an arithmetic number, because the mean of its divisors is an integer number (27785138046400).
Almost surely, 2111112200000001 is an apocalyptic number.
It is an amenable number.
111112200000001 is a deficient number, since it is larger than the sum of its proper divisors (28352185599).
111112200000001 is an equidigital number, since it uses as much as digits as its factorization.
111112200000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28352185598.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 111112200000001 its reverse (100000002211111), we get a palindrome (211112202211112).
The spelling of 111112200000001 in words is "one hundred eleven trillion, one hundred twelve billion, two hundred million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •