Base | Representation |
---|---|
bin | 101101011110101011001111… |
… | …100111001001010010111001 |
3 | 222020012201212101101000020011 |
4 | 231132223033213021102321 |
5 | 202204112141142320441 |
6 | 1545223545311101521 |
7 | 60062655535443364 |
oct | 5536531747112271 |
9 | 866181771330204 |
10 | 200020110120121 |
11 | 58807063716235 |
12 | 1a5252a22118a1 |
13 | 877ba7a711745 |
14 | 375704c7b30db |
15 | 181ceae80d581 |
hex | b5eacf9c94b9 |
200020110120121 has 2 divisors, whose sum is σ = 200020110120122. Its totient is φ = 200020110120120.
The previous prime is 200020110120119. The next prime is 200020110120167. The reversal of 200020110120121 is 121021011020002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110587833405625 + 89432276714496 = 10516075^2 + 9456864^2 .
It is a cyclic number.
It is not a de Polignac number, because 200020110120121 - 21 = 200020110120119 is a prime.
Together with 200020110120119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (200020110129121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100010055060060 + 100010055060061.
It is an arithmetic number, because the mean of its divisors is an integer number (100010055060061).
Almost surely, 2200020110120121 is an apocalyptic number.
It is an amenable number.
200020110120121 is a deficient number, since it is larger than the sum of its proper divisors (1).
200020110120121 is an equidigital number, since it uses as much as digits as its factorization.
200020110120121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200020110120121 its reverse (121021011020002), we get a palindrome (321041121140123).
The spelling of 200020110120121 in words is "two hundred trillion, twenty billion, one hundred ten million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •