Base | Representation |
---|---|
bin | 1010010101110001… |
… | …1111011000101001 |
3 | 21011102222122020101 |
4 | 2211130133120221 |
5 | 21141040143400 |
6 | 1135233025401 |
7 | 125533065502 |
oct | 24534373051 |
9 | 7142878211 |
10 | 2775709225 |
11 | 11a48a7473 |
12 | 6556b5261 |
13 | 3530a3ac3 |
14 | 1c48ddba9 |
15 | 113a3c56a |
hex | a571f629 |
2775709225 has 27 divisors (see below), whose sum is σ = 3541655791. Its totient is φ = 2157977600.
The previous prime is 2775709151. The next prime is 2775709249. The reversal of 2775709225 is 5229075772.
The square root of 2775709225 is 52685.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 1513754649 + 1261954576 = 38907^2 + 35524^2 .
It is not a de Polignac number, because 2775709225 - 211 = 2775707177 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 (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 10800297 + ... + 10800553.
Almost surely, 22775709225 is an apocalyptic number.
2775709225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2775709225 is the 52685-th square number.
2775709225 is the 26343-rd centered octagonal number.
It is an amenable number.
2775709225 is a deficient number, since it is larger than the sum of its proper divisors (765946566).
2775709225 is an frugal number, since it uses more digits than its factorization.
2775709225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606 (or 303 counting only the distinct ones).
The product of its (nonzero) digits is 617400, while the sum is 46.
The cubic root of 2775709225 is about 1405.3720851885.
The spelling of 2775709225 in words is "two billion, seven hundred seventy-five million, seven hundred nine thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •