Base | Representation |
---|---|
bin | 1100110110000011100… |
… | …0111101001100011101 |
3 | 210002120210102100111122 |
4 | 3031200320331030131 |
5 | 12103412213004144 |
6 | 245212431500325 |
7 | 21641244331253 |
oct | 3154070751435 |
9 | 702523370448 |
10 | 220668875549 |
11 | 85648911331 |
12 | 369256876a5 |
13 | 17a69459455 |
14 | a97515c5d3 |
15 | 5b17cb57ee |
hex | 3360e3d31d |
220668875549 has 8 divisors (see below), whose sum is σ = 221901233400. Its totient is φ = 219439415296.
The previous prime is 220668875507. The next prime is 220668875563. The reversal of 220668875549 is 945578866022.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 112416031225 + 108252844324 = 335285^2 + 329018^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220668875549 - 212 = 220668871453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220668875491 and 220668875500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220668875579) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 571574 + ... + 876375.
It is an arithmetic number, because the mean of its divisors is an integer number (27737654175).
Almost surely, 2220668875549 is an apocalyptic number.
It is an amenable number.
220668875549 is a deficient number, since it is larger than the sum of its proper divisors (1232357851).
220668875549 is a wasteful number, since it uses less digits than its factorization.
220668875549 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1448799.
The product of its (nonzero) digits is 58060800, while the sum is 62.
The spelling of 220668875549 in words is "two hundred twenty billion, six hundred sixty-eight million, eight hundred seventy-five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •