Base | Representation |
---|---|
bin | 11001010000101111111111… |
… | …001010100101100111001011 |
3 | 112120101021012100022200212112 |
4 | 121100233333022211213023 |
5 | 104030244301200324321 |
6 | 1032143351315132535 |
7 | 32254604042161133 |
oct | 3120577712454713 |
9 | 476337170280775 |
10 | 111102200011211 |
11 | 324451a6529172 |
12 | 10564425ba414b |
13 | 49cbb7aab31c6 |
14 | 1d61537689ac3 |
15 | cca0533d3a5b |
hex | 650bff2a59cb |
111102200011211 has 4 divisors (see below), whose sum is σ = 113812009767624. Its totient is φ = 108392390254800.
The previous prime is 111102200011151. The next prime is 111102200011213. The reversal of 111102200011211 is 112110002201111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111102200011211 is a prime.
It is a super-2 number, since 2×1111022000112112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111102200011213) 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, 1354904878145 + ... + 1354904878226.
It is an arithmetic number, because the mean of its divisors is an integer number (28453002441906).
Almost surely, 2111102200011211 is an apocalyptic number.
111102200011211 is a deficient number, since it is larger than the sum of its proper divisors (2709809756413).
111102200011211 is an equidigital number, since it uses as much as digits as its factorization.
111102200011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2709809756412.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 111102200011211 its reverse (112110002201111), we get a palindrome (223212202212322).
The spelling of 111102200011211 in words is "one hundred eleven trillion, one hundred two billion, two hundred million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •