Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …01111101001000100001001 |
3 | 2121220002210200122120020011 |
4 | 10203113020033221010021 |
5 | 10111020432220011332 |
6 | 110330023410231521 |
7 | 4134361555604116 |
oct | 443271017510411 |
9 | 77802720576204 |
10 | 20022202110217 |
11 | 641a40612805a |
12 | 22b452ab855a1 |
13 | b23115c7b668 |
14 | 4d3118bad90d |
15 | 24ac540d8e47 |
hex | 1235c83e9109 |
20022202110217 has 2 divisors, whose sum is σ = 20022202110218. Its totient is φ = 20022202110216.
The previous prime is 20022202110187. The next prime is 20022202110221. The reversal of 20022202110217 is 71201120222002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19989161413776 + 33040696441 = 4470924^2 + 181771^2 .
It is a cyclic number.
It is not a de Polignac number, because 20022202110217 - 223 = 20022193721609 is a prime.
It is not a weakly prime, because it can be changed into another prime (20022202110247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011101055108 + 10011101055109.
It is an arithmetic number, because the mean of its divisors is an integer number (10011101055109).
Almost surely, 220022202110217 is an apocalyptic number.
It is an amenable number.
20022202110217 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022202110217 is an equidigital number, since it uses as much as digits as its factorization.
20022202110217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 20022202110217 its reverse (71201120222002), we get a palindrome (91223322332219).
The spelling of 20022202110217 in words is "twenty trillion, twenty-two billion, two hundred two million, one hundred ten thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •