Base | Representation |
---|---|
bin | 110010000100111111110000… |
… | …011010101111111110010001 |
3 | 1001212211021112211120120200102 |
4 | 302010333300122233332101 |
5 | 212332001103322000130 |
6 | 2100231243214302145 |
7 | 64251136544640002 |
oct | 6204776032577621 |
9 | 1055737484516612 |
10 | 220245661515665 |
11 | 641a472a151095 |
12 | 208511024b7955 |
13 | 95b80cc8595b6 |
14 | 3c55d383cd1a9 |
15 | 1a6e165e07645 |
hex | c84ff06aff91 |
220245661515665 has 8 divisors (see below), whose sum is σ = 264294895985640. Its totient is φ = 176196461101312.
The previous prime is 220245661515623. The next prime is 220245661515721. The reversal of 220245661515665 is 566515166542022.
It can be written as a sum of positive squares in 4 ways, for example, as 4726584713041 + 215519076802624 = 2174071^2 + 14680568^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 220245661515665 - 226 = 220245594406801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220245661515665.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8982857 + ... + 22829433.
It is an arithmetic number, because the mean of its divisors is an integer number (33036861998205).
Almost surely, 2220245661515665 is an apocalyptic number.
It is an amenable number.
220245661515665 is a deficient number, since it is larger than the sum of its proper divisors (44049234469975).
220245661515665 is a wasteful number, since it uses less digits than its factorization.
220245661515665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17027811.
The product of its (nonzero) digits is 25920000, while the sum is 56.
The spelling of 220245661515665 in words is "two hundred twenty trillion, two hundred forty-five billion, six hundred sixty-one million, five hundred fifteen thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •