Base | Representation |
---|---|
bin | 101101011111110110110001… |
… | …000000010101110101101011 |
3 | 222020111111011202012000211222 |
4 | 231133312301000111311223 |
5 | 202211424224424310102 |
6 | 1545325120034212255 |
7 | 60101556204566132 |
oct | 5537666100256553 |
9 | 866444152160758 |
10 | 200101201010027 |
11 | 58838496385019 |
12 | 1a538b5342408b |
13 | 8786601857735 |
14 | 375ad42398919 |
15 | 1820158963aa2 |
hex | b5fdb1015d6b |
200101201010027 has 2 divisors, whose sum is σ = 200101201010028. Its totient is φ = 200101201010026.
The previous prime is 200101201009991. The next prime is 200101201010057. The reversal of 200101201010027 is 720010102101002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200101201010027 - 218 = 200101200747883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200101201009987 and 200101201010014.
It is not a weakly prime, because it can be changed into another prime (200101201010057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050600505013 + 100050600505014.
It is an arithmetic number, because the mean of its divisors is an integer number (100050600505014).
Almost surely, 2200101201010027 is an apocalyptic number.
200101201010027 is a deficient number, since it is larger than the sum of its proper divisors (1).
200101201010027 is an equidigital number, since it uses as much as digits as its factorization.
200101201010027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 200101201010027 its reverse (720010102101002), we get a palindrome (920111303111029).
The spelling of 200101201010027 in words is "two hundred trillion, one hundred one billion, two hundred one million, ten thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •