Base | Representation |
---|---|
bin | 110010000100010111010001… |
… | …111110011100011100010001 |
3 | 1001212200010101000011000210011 |
4 | 302010113101332130130101 |
5 | 212330243101440344233 |
6 | 2100155254503034521 |
7 | 64245040551360565 |
oct | 6204272176343421 |
9 | 1055603330130704 |
10 | 220202201106193 |
11 | 64188257957209 |
12 | 208447b373ba41 |
13 | 95b3c948bca87 |
14 | 3c53bb440b6a5 |
15 | 1a6ce707340cd |
hex | c845d1f9c711 |
220202201106193 has 2 divisors, whose sum is σ = 220202201106194. Its totient is φ = 220202201106192.
The previous prime is 220202201106191. The next prime is 220202201106289. The reversal of 220202201106193 is 391601102202022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 197846392060944 + 22355809045249 = 14065788^2 + 4728193^2 .
It is a cyclic number.
It is not a de Polignac number, because 220202201106193 - 21 = 220202201106191 is a prime.
Together with 220202201106191, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (220202201106191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110101100553096 + 110101100553097.
It is an arithmetic number, because the mean of its divisors is an integer number (110101100553097).
Almost surely, 2220202201106193 is an apocalyptic number.
It is an amenable number.
220202201106193 is a deficient number, since it is larger than the sum of its proper divisors (1).
220202201106193 is an equidigital number, since it uses as much as digits as its factorization.
220202201106193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 220202201106193 in words is "two hundred twenty trillion, two hundred two billion, two hundred one million, one hundred six thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.719 sec. • engine limits •