Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110011100011101001111 |
3 | 222020212222120220102112101002 |
4 | 231201131001212130131033 |
5 | 202220224112240200421 |
6 | 1545451355243210515 |
7 | 60112524151135631 |
oct | 5541350146343517 |
9 | 866788526375332 |
10 | 200211001100111 |
11 | 588800106a3921 |
12 | 1a556297216a3b |
13 | 8793a7c7cc341 |
14 | 376239abc0a51 |
15 | 1822e3321db0b |
hex | b6174199c74f |
200211001100111 has 4 divisors (see below), whose sum is σ = 200211287506800. Its totient is φ = 200210714693424.
The previous prime is 200211001100063. The next prime is 200211001100119. The reversal of 200211001100111 is 111001100112002.
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-200211001100111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211001100092 and 200211001100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211001100119) 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, 142152206 + ... + 143553723.
It is an arithmetic number, because the mean of its divisors is an integer number (50052821876700).
Almost surely, 2200211001100111 is an apocalyptic number.
200211001100111 is a deficient number, since it is larger than the sum of its proper divisors (286406689).
200211001100111 is an equidigital number, since it uses as much as digits as its factorization.
200211001100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286406688.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 200211001100111 its reverse (111001100112002), we get a palindrome (311212101212113).
The spelling of 200211001100111 in words is "two hundred trillion, two hundred eleven billion, one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •