Base | Representation |
---|---|
bin | 1001101101001111… |
… | …0010110011101101 |
3 | 20201121000002212212 |
4 | 2123103302303231 |
5 | 20314022013300 |
6 | 1110320140205 |
7 | 121366502405 |
oct | 23323626355 |
9 | 6647002785 |
10 | 2605657325 |
11 | 1117909a07 |
12 | 608767665 |
13 | 326aa3c8b |
14 | 1aa0b5805 |
15 | 103b4b935 |
hex | 9b4f2ced |
2605657325 has 6 divisors (see below), whose sum is σ = 3231015114. Its totient is φ = 2084525840.
The previous prime is 2605657309. The next prime is 2605657363. The reversal of 2605657325 is 5237565062.
It can be written as a sum of positive squares in 3 ways, for example, as 73856836 + 2531800489 = 8594^2 + 50317^2 .
It is not a de Polignac number, because 2605657325 - 24 = 2605657309 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 52113122 + ... + 52113171.
It is an arithmetic number, because the mean of its divisors is an integer number (538502519).
Almost surely, 22605657325 is an apocalyptic number.
2605657325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2605657325 is a deficient number, since it is larger than the sum of its proper divisors (625357789).
2605657325 is a wasteful number, since it uses less digits than its factorization.
2605657325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104226303 (or 104226298 counting only the distinct ones).
The product of its (nonzero) digits is 378000, while the sum is 41.
The square root of 2605657325 is about 51045.6396276900. The cubic root of 2605657325 is about 1376.0654793872.
The spelling of 2605657325 in words is "two billion, six hundred five million, six hundred fifty-seven thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •