Base | Representation |
---|---|
bin | 1001001100100000111011… |
… | …00000110110011000111001 |
3 | 2122121010110021111201220002 |
4 | 10212100131200312120321 |
5 | 10122301010000231332 |
6 | 111001254103042345 |
7 | 4154635134024632 |
oct | 446203540663071 |
9 | 78533407451802 |
10 | 20221201180217 |
11 | 649684399a784 |
12 | 23270074403b5 |
13 | b38b0aac625b |
14 | 4dc9d5d80889 |
15 | 250eee746562 |
hex | 12641d836639 |
20221201180217 has 2 divisors, whose sum is σ = 20221201180218. Its totient is φ = 20221201180216.
The previous prime is 20221201180163. The next prime is 20221201180247. The reversal of 20221201180217 is 71208110212202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17560700921401 + 2660500258816 = 4190549^2 + 1631104^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20221201180217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20221201180217.
It is not a weakly prime, because it can be changed into another prime (20221201180247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110600590108 + 10110600590109.
It is an arithmetic number, because the mean of its divisors is an integer number (10110600590109).
Almost surely, 220221201180217 is an apocalyptic number.
It is an amenable number.
20221201180217 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221201180217 is an equidigital number, since it uses as much as digits as its factorization.
20221201180217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1792, while the sum is 29.
Adding to 20221201180217 its reverse (71208110212202), we get a palindrome (91429311392419).
The spelling of 20221201180217 in words is "twenty trillion, two hundred twenty-one billion, two hundred one million, one hundred eighty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •