Base | Representation |
---|---|
bin | 101101011110100011111000… |
… | …101111000010010101010001 |
3 | 222020011222110211010102101201 |
4 | 231132203320233002111101 |
5 | 202204000001242320032 |
6 | 1545220201342431201 |
7 | 60062256010525201 |
oct | 5536437057022521 |
9 | 866158424112351 |
10 | 200012210120017 |
11 | 5880377a33a229 |
12 | 1a523858592501 |
13 | 877b0bbb12079 |
14 | 37568dd4da401 |
15 | 181cb9aeb78e7 |
hex | b5e8f8bc2551 |
200012210120017 has 2 divisors, whose sum is σ = 200012210120018. Its totient is φ = 200012210120016.
The previous prime is 200012210119993. The next prime is 200012210120059. The reversal of 200012210120017 is 710021012210002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198838229202001 + 1173980918016 = 14101001^2 + 1083504^2 .
It is a cyclic number.
It is not a de Polignac number, because 200012210120017 - 27 = 200012210119889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200012210119976 and 200012210120003.
It is not a weakly prime, because it can be changed into another prime (200012210160017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100006105060008 + 100006105060009.
It is an arithmetic number, because the mean of its divisors is an integer number (100006105060009).
Almost surely, 2200012210120017 is an apocalyptic number.
It is an amenable number.
200012210120017 is a deficient number, since it is larger than the sum of its proper divisors (1).
200012210120017 is an equidigital number, since it uses as much as digits as its factorization.
200012210120017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 200012210120017 its reverse (710021012210002), we get a palindrome (910033222330019).
The spelling of 200012210120017 in words is "two hundred trillion, twelve billion, two hundred ten million, one hundred twenty thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •