Base | Representation |
---|---|
bin | 11001010000110111010001… |
… | …010001011110100111010011 |
3 | 112120102000101100000022002202 |
4 | 121100313101101132213103 |
5 | 104030411310110001321 |
6 | 1032151123304433415 |
7 | 32255301606035651 |
oct | 3120672121364723 |
9 | 476360340008082 |
10 | 111110020000211 |
11 | 324485497266a1 |
12 | 10565a48a7886b |
13 | 49cc825c4a42b |
14 | 1d61a7a095dd1 |
15 | cca35ebc270b |
hex | 650dd145e9d3 |
111110020000211 has 4 divisors (see below), whose sum is σ = 111111407620032. Its totient is φ = 111108632380392.
The previous prime is 111110020000183. The next prime is 111110020000237. The reversal of 111110020000211 is 112000020011111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111110020000211 - 234 = 111092840131027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111110020000192 and 111110020000201.
It is not an unprimeable number, because it can be changed into a prime (111110020000711) 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, 693689795 + ... + 693849948.
It is an arithmetic number, because the mean of its divisors is an integer number (27777851905008).
Almost surely, 2111110020000211 is an apocalyptic number.
111110020000211 is a deficient number, since it is larger than the sum of its proper divisors (1387619821).
111110020000211 is an equidigital number, since it uses as much as digits as its factorization.
111110020000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1387619820.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111110020000211 its reverse (112000020011111), we get a palindrome (223110040011322).
The spelling of 111110020000211 in words is "one hundred eleven trillion, one hundred ten billion, twenty million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •