Base | Representation |
---|---|
bin | 1000010000011000… |
… | …1001101100001001 |
3 | 12201110011212211002 |
4 | 2010012021230021 |
5 | 14014322030230 |
6 | 1003524544345 |
7 | 105630301154 |
oct | 20406115411 |
9 | 5643155732 |
10 | 2216205065 |
11 | a37a98738 |
12 | 51a2520b5 |
13 | 2941b6659 |
14 | 170498c9b |
15 | ce86d545 |
hex | 84189b09 |
2216205065 has 4 divisors (see below), whose sum is σ = 2659446084. Its totient is φ = 1772964048.
The previous prime is 2216205059. The next prime is 2216205071. The reversal of 2216205065 is 5605026122.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (2216205059) and next prime (2216205071).
It can be written as a sum of positive squares in 2 ways, for example, as 1434667129 + 781537936 = 37877^2 + 27956^2 .
It is a cyclic number.
It is not a de Polignac number, because 2216205065 - 230 = 1142463241 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221620502 + ... + 221620511.
It is an arithmetic number, because the mean of its divisors is an integer number (664861521).
Almost surely, 22216205065 is an apocalyptic number.
It is an amenable number.
2216205065 is a deficient number, since it is larger than the sum of its proper divisors (443241019).
2216205065 is an equidigital number, since it uses as much as digits as its factorization.
2216205065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443241018.
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 2216205065 is about 47076.5872276230. The cubic root of 2216205065 is about 1303.7769970145.
The spelling of 2216205065 in words is "two billion, two hundred sixteen million, two hundred five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •