Base | Representation |
---|---|
bin | 11010001111100… |
… | …10100100101101 |
3 | 120100020120111021 |
4 | 31013302210231 |
5 | 422324132330 |
6 | 33502254141 |
7 | 5312131654 |
oct | 1507624455 |
9 | 510216437 |
10 | 220145965 |
11 | 1032a2a16 |
12 | 61887351 |
13 | 367bbcb0 |
14 | 2134819b |
15 | 144d867a |
hex | d1f292d |
220145965 has 8 divisors (see below), whose sum is σ = 284496408. Its totient is φ = 162569280.
The previous prime is 220145957. The next prime is 220145969. The reversal of 220145965 is 569541022.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 18818244 + 201327721 = 4338^2 + 14189^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220145965 - 23 = 220145957 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 220145965.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220145969) 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, 1693366 + ... + 1693495.
It is an arithmetic number, because the mean of its divisors is an integer number (35562051).
Almost surely, 2220145965 is an apocalyptic number.
It is an amenable number.
220145965 is a deficient number, since it is larger than the sum of its proper divisors (64350443).
220145965 is a wasteful number, since it uses less digits than its factorization.
220145965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3386879.
The product of its (nonzero) digits is 21600, while the sum is 34.
The square root of 220145965 is about 14837.3166374517. The cubic root of 220145965 is about 603.8145537212.
Adding to 220145965 its reverse (569541022), we get a palindrome (789686987).
The spelling of 220145965 in words is "two hundred twenty million, one hundred forty-five thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •