Base | Representation |
---|---|
bin | 10111001100100101101101… |
… | …110010000011100011111001 |
3 | 111101020000222011001201122201 |
4 | 113030211231302003203321 |
5 | 101332444332201121332 |
6 | 1000551233300150201 |
7 | 30326500443034453 |
oct | 2714455562034371 |
9 | 441200864051581 |
10 | 102020200020217 |
11 | 2a563584283146 |
12 | b538246698361 |
13 | 44c06046484ab |
14 | 1b29b383732d3 |
15 | bbdba5d785e7 |
hex | 5cc96dc838f9 |
102020200020217 has 2 divisors, whose sum is σ = 102020200020218. Its totient is φ = 102020200020216.
The previous prime is 102020200020173. The next prime is 102020200020223. The reversal of 102020200020217 is 712020002020201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73708904281321 + 28311295738896 = 8585389^2 + 5320836^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102020200020217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102020200020194 and 102020200020203.
It is not a weakly prime, because it can be changed into another prime (102020200020017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51010100010108 + 51010100010109.
It is an arithmetic number, because the mean of its divisors is an integer number (51010100010109).
Almost surely, 2102020200020217 is an apocalyptic number.
It is an amenable number.
102020200020217 is a deficient number, since it is larger than the sum of its proper divisors (1).
102020200020217 is an equidigital number, since it uses as much as digits as its factorization.
102020200020217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 19.
Adding to 102020200020217 its reverse (712020002020201), we get a palindrome (814040202040418).
The spelling of 102020200020217 in words is "one hundred two trillion, twenty billion, two hundred million, twenty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •