Base | Representation |
---|---|
bin | 1010010101101110… |
… | …0100000000000101 |
3 | 21011102112021120122 |
4 | 2211123210000011 |
5 | 21141004402424 |
6 | 1135223511325 |
7 | 125531033402 |
oct | 24533440005 |
9 | 7142467518 |
10 | 2775465989 |
11 | 11a475074a |
12 | 6555b8545 |
13 | 35301a18a |
14 | 1c48792a9 |
15 | 1139e045e |
hex | a56e4005 |
2775465989 has 2 divisors, whose sum is σ = 2775465990. Its totient is φ = 2775465988.
The previous prime is 2775465971. The next prime is 2775466007. The reversal of 2775465989 is 9895645772.
It is a balanced prime because it is at equal distance from previous prime (2775465971) and next prime (2775466007).
It can be written as a sum of positive squares in only one way, i.e., 2249130625 + 526335364 = 47425^2 + 22942^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2775465989 is a prime.
It is a super-2 number, since 2×27754659892 = 15406422912191496242, 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 (2775465289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1387732994 + 1387732995.
It is an arithmetic number, because the mean of its divisors is an integer number (1387732995).
Almost surely, 22775465989 is an apocalyptic number.
It is an amenable number.
2775465989 is a deficient number, since it is larger than the sum of its proper divisors (1).
2775465989 is an equidigital number, since it uses as much as digits as its factorization.
2775465989 is an evil number, because the sum of its binary digits is even.
The product of its digits is 38102400, while the sum is 62.
The square root of 2775465989 is about 52682.6915504514. The cubic root of 2775465989 is about 1405.3310329694.
The spelling of 2775465989 in words is "two billion, seven hundred seventy-five million, four hundred sixty-five thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •