Base | Representation |
---|---|
bin | 110010001001110001001011… |
… | …100100010110001100111101 |
3 | 1001220222122001000020221221221 |
4 | 302021301023210112030331 |
5 | 212402334222204211301 |
6 | 2101042041115353341 |
7 | 64313626431244165 |
oct | 6211611344261475 |
9 | 1056878030227857 |
10 | 220573608272701 |
11 | 64310818589602 |
12 | 208a4787152851 |
13 | 9610004553718 |
14 | 3c67b68dc15a5 |
15 | 1a7795bd11da1 |
hex | c89c4b91633d |
220573608272701 has 2 divisors, whose sum is σ = 220573608272702. Its totient is φ = 220573608272700.
The previous prime is 220573608272687. The next prime is 220573608272749. The reversal of 220573608272701 is 107272806375022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202030689062500 + 18542919210201 = 14213750^2 + 4306149^2 .
It is a cyclic number.
It is not a de Polignac number, because 220573608272701 - 213 = 220573608264509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220573608272791) 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, 110286804136350 + 110286804136351.
It is an arithmetic number, because the mean of its divisors is an integer number (110286804136351).
Almost surely, 2220573608272701 is an apocalyptic number.
It is an amenable number.
220573608272701 is a deficient number, since it is larger than the sum of its proper divisors (1).
220573608272701 is an equidigital number, since it uses as much as digits as its factorization.
220573608272701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3951360, while the sum is 52.
The spelling of 220573608272701 in words is "two hundred twenty trillion, five hundred seventy-three billion, six hundred eight million, two hundred seventy-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •