Base | Representation |
---|---|
bin | 11001001111011010010011… |
… | …100010011001111000111111 |
3 | 112120001110201201002000001002 |
4 | 121033122103202121320333 |
5 | 104022242342200031421 |
6 | 1032033214251440515 |
7 | 32245136146044224 |
oct | 3117322342317077 |
9 | 476043651060032 |
10 | 111010200002111 |
11 | 3240a1859646a3 |
12 | 1054a62b45613b |
13 | 49c32a88126b7 |
14 | 1d5accaccd94b |
15 | cc796b691b0b |
hex | 64f693899e3f |
111010200002111 has 4 divisors (see below), whose sum is σ = 111010290239472. Its totient is φ = 111010109764752.
The previous prime is 111010200002063. The next prime is 111010200002113. The reversal of 111010200002111 is 111200002010111.
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 111010200002111 - 246 = 40641455824447 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111010200002092 and 111010200002101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111010200002113) 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, 43247510 + ... + 45742403.
It is an arithmetic number, because the mean of its divisors is an integer number (27752572559868).
Almost surely, 2111010200002111 is an apocalyptic number.
111010200002111 is a deficient number, since it is larger than the sum of its proper divisors (90237361).
111010200002111 is an equidigital number, since it uses as much as digits as its factorization.
111010200002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90237360.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111010200002111 its reverse (111200002010111), we get a palindrome (222210202012222).
The spelling of 111010200002111 in words is "one hundred eleven trillion, ten billion, two hundred million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.991 sec. • engine limits •