Base | Representation |
---|---|
bin | 101101011110011001011101… |
… | …001101110100111000100111 |
3 | 222020010220120100000202002101 |
4 | 231132121131031310320213 |
5 | 202203304032304323421 |
6 | 1545211110202552531 |
7 | 60061411332626002 |
oct | 5536313515647047 |
9 | 866126510022071 |
10 | 200001011011111 |
11 | 587a9a52777a22 |
12 | 1a521651b08747 |
13 | 877a025882bcb |
14 | 3756159dda539 |
15 | 181c742be8191 |
hex | b5e65d374e27 |
200001011011111 has 4 divisors (see below), whose sum is σ = 200001044892424. Its totient is φ = 200000977129800.
The previous prime is 200001011011093. The next prime is 200001011011129. The reversal of 200001011011111 is 111110110100002.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (200001011011093) and next prime (200001011011129).
It is a cyclic number.
It is not a de Polignac number, because 200001011011111 - 29 = 200001011010599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200001011011181) 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, 5519520 + ... + 20747701.
It is an arithmetic number, because the mean of its divisors is an integer number (50000261223106).
Almost surely, 2200001011011111 is an apocalyptic number.
200001011011111 is a deficient number, since it is larger than the sum of its proper divisors (33881313).
200001011011111 is an equidigital number, since it uses as much as digits as its factorization.
200001011011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33881312.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 200001011011111 its reverse (111110110100002), we get a palindrome (311111121111113).
The spelling of 200001011011111 in words is "two hundred trillion, one billion, eleven million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •