Base | Representation |
---|---|
bin | 1100110100000001000… |
… | …1001001110011110101 |
3 | 210001011122120101012002 |
4 | 3031000101021303311 |
5 | 12101302110224144 |
6 | 245042241105045 |
7 | 21621550322666 |
oct | 3150021116365 |
9 | 701148511162 |
10 | 220121570549 |
11 | 85397984a51 |
12 | 367b2328185 |
13 | 179acc5083a |
14 | a9225b136d |
15 | 5ad4c0614e |
hex | 3340449cf5 |
220121570549 has 2 divisors, whose sum is σ = 220121570550. Its totient is φ = 220121570548.
The previous prime is 220121570483. The next prime is 220121570621. The reversal of 220121570549 is 945075121022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145250929924 + 74870640625 = 381118^2 + 273625^2 .
It is a cyclic number.
It is not a de Polignac number, because 220121570549 - 228 = 219853135093 is a prime.
It is a super-2 number, since 2×2201215705492 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220121570749) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110060785274 + 110060785275.
It is an arithmetic number, because the mean of its divisors is an integer number (110060785275).
Almost surely, 2220121570549 is an apocalyptic number.
It is an amenable number.
220121570549 is a deficient number, since it is larger than the sum of its proper divisors (1).
220121570549 is an equidigital number, since it uses as much as digits as its factorization.
220121570549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 38.
The spelling of 220121570549 in words is "two hundred twenty billion, one hundred twenty-one million, five hundred seventy thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •