Base | Representation |
---|---|
bin | 1100110100000100100… |
… | …1111000010010001001 |
3 | 210001012200112212120101 |
4 | 3031001021320102021 |
5 | 12101314412102334 |
6 | 245043531525401 |
7 | 21622120605664 |
oct | 3150111702211 |
9 | 701180485511 |
10 | 220136440969 |
11 | 853a5311355 |
12 | 367b72b9861 |
13 | 179b30591c3 |
14 | a9245626db |
15 | 5ad6192214 |
hex | 3341278489 |
220136440969 has 9 divisors (see below), whose sum is σ = 220989423783. Its totient is φ = 219286743312.
The previous prime is 220136440913. The next prime is 220136440999. The reversal of 220136440969 is 969044631022.
The square root of 220136440969 is 469187.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1404375625 + 218732065344 = 37475^2 + 467688^2 .
It is not a de Polignac number, because 220136440969 - 29 = 220136440457 is a prime.
It is a super-2 number, since 2×2201364409692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220136440999) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 146854782 + ... + 146856280.
Almost surely, 2220136440969 is an apocalyptic number.
220136440969 is the 469187-th square number.
220136440969 is the 234594-th centered octagonal number.
It is an amenable number.
220136440969 is a deficient number, since it is larger than the sum of its proper divisors (852982814).
220136440969 is an frugal number, since it uses more digits than its factorization.
220136440969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3624 (or 1812 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 46.
The spelling of 220136440969 in words is "two hundred twenty billion, one hundred thirty-six million, four hundred forty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •