Base | Representation |
---|---|
bin | 101101100000001000011110… |
… | …101000000100011010001111 |
3 | 222020120022021012210100020002 |
4 | 231200020132220010122033 |
5 | 202212232202310311002 |
6 | 1545341543201314515 |
7 | 60103131415455044 |
oct | 5540103650043217 |
9 | 866508235710202 |
10 | 200120220010127 |
11 | 5884556608831a |
12 | 1a540780935a3b |
13 | 8788342c18451 |
14 | 375bc2827b1cb |
15 | 18208bd503002 |
hex | b6021ea0468f |
200120220010127 has 2 divisors, whose sum is σ = 200120220010128. Its totient is φ = 200120220010126.
The previous prime is 200120220010069. The next prime is 200120220010181. The reversal of 200120220010127 is 721010022021002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200120220010127 - 246 = 129751475832463 is a prime.
It is a super-2 number, since 2×2001202200101272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200120220010099 and 200120220010108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200120220010727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100060110005063 + 100060110005064.
It is an arithmetic number, because the mean of its divisors is an integer number (100060110005064).
Almost surely, 2200120220010127 is an apocalyptic number.
200120220010127 is a deficient number, since it is larger than the sum of its proper divisors (1).
200120220010127 is an equidigital number, since it uses as much as digits as its factorization.
200120220010127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 200120220010127 its reverse (721010022021002), we get a palindrome (921130242031129).
The spelling of 200120220010127 in words is "two hundred trillion, one hundred twenty billion, two hundred twenty million, ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •