Base | Representation |
---|---|
bin | 1001101101001001… |
… | …0111101100001101 |
3 | 20201120022010221001 |
4 | 2123102113230031 |
5 | 20313423042414 |
6 | 1110304140301 |
7 | 121363356331 |
oct | 23322275415 |
9 | 6646263831 |
10 | 2605284109 |
11 | 111768456a |
12 | 608607691 |
13 | 3269a313c |
14 | 1aa0197c1 |
15 | 103ac6074 |
hex | 9b497b0d |
2605284109 has 2 divisors, whose sum is σ = 2605284110. Its totient is φ = 2605284108.
The previous prime is 2605284091. The next prime is 2605284131. The reversal of 2605284109 is 9014825062.
Together with previous prime (2605284091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1599760009 + 1005524100 = 39997^2 + 31710^2 .
It is a cyclic number.
It is not a de Polignac number, because 2605284109 - 217 = 2605153037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2605284139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302642054 + 1302642055.
It is an arithmetic number, because the mean of its divisors is an integer number (1302642055).
Almost surely, 22605284109 is an apocalyptic number.
It is an amenable number.
2605284109 is a deficient number, since it is larger than the sum of its proper divisors (1).
2605284109 is an equidigital number, since it uses as much as digits as its factorization.
2605284109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 37.
The square root of 2605284109 is about 51041.9837878584. The cubic root of 2605284109 is about 1375.9997769416. Note that the first 3 decimals are identical.
The spelling of 2605284109 in words is "two billion, six hundred five million, two hundred eighty-four thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •