Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100010101000010100011001 |
3 | 222020212222120211112201122102 |
4 | 231201131001202220110121 |
5 | 202220224112011200441 |
6 | 1545451355205533145 |
7 | 60112524136502333 |
oct | 5541350142502431 |
9 | 866788524481572 |
10 | 200211000100121 |
11 | 5888001008058a |
12 | 1a556296a141b5 |
13 | 8793a7c53c12a |
14 | 376239aa00453 |
15 | 1822e330c269b |
hex | b617418a8519 |
200211000100121 has 2 divisors, whose sum is σ = 200211000100122. Its totient is φ = 200211000100120.
The previous prime is 200211000100091. The next prime is 200211000100129. The reversal of 200211000100121 is 121001000112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 168383349540121 + 31827650560000 = 12976261^2 + 5641600^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211000100121 - 26 = 200211000100057 is a prime.
It is a super-2 number, since 2×2002110001001212 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200211000100129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105500050060 + 100105500050061.
It is an arithmetic number, because the mean of its divisors is an integer number (100105500050061).
Almost surely, 2200211000100121 is an apocalyptic number.
It is an amenable number.
200211000100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211000100121 is an equidigital number, since it uses as much as digits as its factorization.
200211000100121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200211000100121 its reverse (121001000112002), we get a palindrome (321212000212123).
The spelling of 200211000100121 in words is "two hundred trillion, two hundred eleven billion, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •