Base | Representation |
---|---|
bin | 1011101001000110010… |
… | …1110011000001011011 |
3 | 201010021010011122011211 |
4 | 2322101211303001123 |
5 | 11234110320202001 |
6 | 231514524003551 |
7 | 20310314205154 |
oct | 2722145630133 |
9 | 633233148154 |
10 | 200011100251 |
11 | 77908062a66 |
12 | 3291b3905b7 |
13 | 15b26707781 |
14 | 997577092b |
15 | 5309418351 |
hex | 2e9197305b |
200011100251 has 2 divisors, whose sum is σ = 200011100252. Its totient is φ = 200011100250.
The previous prime is 200011100249. The next prime is 200011100269. The reversal of 200011100251 is 152001110002.
200011100251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200011100251 - 21 = 200011100249 is a prime.
Together with 200011100249, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (200011100221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005550125 + 100005550126.
It is an arithmetic number, because the mean of its divisors is an integer number (100005550126).
Almost surely, 2200011100251 is an apocalyptic number.
200011100251 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011100251 is an equidigital number, since it uses as much as digits as its factorization.
200011100251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 13.
Adding to 200011100251 its reverse (152001110002), we get a palindrome (352012210253).
The spelling of 200011100251 in words is "two hundred billion, eleven million, one hundred thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •