Base | Representation |
---|---|
bin | 111101100001010… |
… | …0111000000000101 |
3 | 12022212022101000021 |
4 | 1323002213000011 |
5 | 13211424002410 |
6 | 540500415141 |
7 | 102104050501 |
oct | 17302470005 |
9 | 5285271007 |
10 | 2064281605 |
11 | 96a262361 |
12 | 4973a74b1 |
13 | 26b893109 |
14 | 15822d301 |
15 | c135deda |
hex | 7b0a7005 |
2064281605 has 4 divisors (see below), whose sum is σ = 2477137932. Its totient is φ = 1651425280.
The previous prime is 2064281573. The next prime is 2064281617. The reversal of 2064281605 is 5061824602.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 677612961 + 1386668644 = 26031^2 + 37238^2 .
It is not a de Polignac number, because 2064281605 - 25 = 2064281573 is a prime.
It is a super-2 number, since 2×20642816052 = 8522517089482752050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 206428156 + ... + 206428165.
It is an arithmetic number, because the mean of its divisors is an integer number (619284483).
Almost surely, 22064281605 is an apocalyptic number.
It is an amenable number.
2064281605 is a deficient number, since it is larger than the sum of its proper divisors (412856327).
2064281605 is an equidigital number, since it uses as much as digits as its factorization.
2064281605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412856326.
The product of its (nonzero) digits is 23040, while the sum is 34.
The square root of 2064281605 is about 45434.3659029154. The cubic root of 2064281605 is about 1273.2772539940.
The spelling of 2064281605 in words is "two billion, sixty-four million, two hundred eighty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •