Base | Representation |
---|---|
bin | 1010110001001110… |
… | …1111001011000101 |
3 | 21110110122122200202 |
4 | 2230103233023011 |
5 | 21410024330414 |
6 | 1154505020245 |
7 | 131431602002 |
oct | 25423571305 |
9 | 7413578622 |
10 | 2890855109 |
11 | 12538a325a |
12 | 688184685 |
13 | 370bbb46c |
14 | 1d5d148a9 |
15 | 11dbd49de |
hex | ac4ef2c5 |
2890855109 has 2 divisors, whose sum is σ = 2890855110. Its totient is φ = 2890855108.
The previous prime is 2890855063. The next prime is 2890855139. The reversal of 2890855109 is 9015580982.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2848890625 + 41964484 = 53375^2 + 6478^2 .
It is a cyclic number.
It is not a de Polignac number, because 2890855109 - 220 = 2889806533 is a prime.
It is a super-2 number, since 2×28908551092 = 16714086522462803762, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2890855139) 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, 1445427554 + 1445427555.
It is an arithmetic number, because the mean of its divisors is an integer number (1445427555).
Almost surely, 22890855109 is an apocalyptic number.
It is an amenable number.
2890855109 is a deficient number, since it is larger than the sum of its proper divisors (1).
2890855109 is an equidigital number, since it uses as much as digits as its factorization.
2890855109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 47.
The square root of 2890855109 is about 53766.6728466622. The cubic root of 2890855109 is about 1424.5426021892.
The spelling of 2890855109 in words is "two billion, eight hundred ninety million, eight hundred fifty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •