Base | Representation |
---|---|
bin | 1001010001101110101101… |
… | …0011011110001110100011 |
3 | 1100010010111111001122000201 |
4 | 2110123223103132032203 |
5 | 2314110002212023021 |
6 | 33405523544130031 |
7 | 2101640316250321 |
oct | 224335323361643 |
9 | 40103444048021 |
10 | 10200200111011 |
11 | 3282976053619 |
12 | 1188a4a466917 |
13 | 58cb4aa70381 |
14 | 273999a20d11 |
15 | 12a4e5c44591 |
hex | 946eb4de3a3 |
10200200111011 has 2 divisors, whose sum is σ = 10200200111012. Its totient is φ = 10200200111010.
The previous prime is 10200200111009. The next prime is 10200200111021. The reversal of 10200200111011 is 11011100200201.
It is an a-pointer prime, because the next prime (10200200111021) can be obtained adding 10200200111011 to its sum of digits (10).
It is a weak prime.
It is an emirp because it is prime and its reverse (11011100200201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10200200111011 - 21 = 10200200111009 is a prime.
Together with 10200200111009, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10200200111021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100100055505 + 5100100055506.
It is an arithmetic number, because the mean of its divisors is an integer number (5100100055506).
Almost surely, 210200200111011 is an apocalyptic number.
10200200111011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200200111011 is an equidigital number, since it uses as much as digits as its factorization.
10200200111011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10200200111011 its reverse (11011100200201), we get a palindrome (21211300311212).
The spelling of 10200200111011 in words is "ten trillion, two hundred billion, two hundred million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •