Base | Representation |
---|---|
bin | 101101100001010010111000… |
… | …100000011101111010000001 |
3 | 222020211221110222000020001102 |
4 | 231201102320200131322001 |
5 | 202220034311421320001 |
6 | 1545442354505144145 |
7 | 60111660245626526 |
oct | 5541227040357201 |
9 | 866757428006042 |
10 | 200200111120001 |
11 | 58876432580663 |
12 | 1a55415818b055 |
13 | 8792a35616125 |
14 | 3761a4678d14d |
15 | 18229e7162e6b |
hex | b614b881de81 |
200200111120001 has 2 divisors, whose sum is σ = 200200111120002. Its totient is φ = 200200111120000.
The previous prime is 200200111119857. The next prime is 200200111120003. The reversal of 200200111120001 is 100021111002002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 157231561718401 + 42968549401600 = 12539201^2 + 6555040^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200200111120001 is a prime.
Together with 200200111120003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (200200111120003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100100055560000 + 100100055560001.
It is an arithmetic number, because the mean of its divisors is an integer number (100100055560001).
Almost surely, 2200200111120001 is an apocalyptic number.
It is an amenable number.
200200111120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
200200111120001 is an equidigital number, since it uses as much as digits as its factorization.
200200111120001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200200111120001 its reverse (100021111002002), we get a palindrome (300221222122003).
The spelling of 200200111120001 in words is "two hundred trillion, two hundred billion, one hundred eleven million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •