Base | Representation |
---|---|
bin | 110000111000… |
… | …1011101100101 |
3 | 1210020011112012 |
4 | 1201301131211 |
5 | 23030134230 |
6 | 2313204005 |
7 | 430566452 |
oct | 141613545 |
9 | 53204465 |
10 | 25630565 |
11 | 13516694 |
12 | 8700605 |
13 | 540521c |
14 | 3592829 |
15 | 23b4395 |
hex | 1871765 |
25630565 has 4 divisors (see below), whose sum is σ = 30756684. Its totient is φ = 20504448.
The previous prime is 25630559. The next prime is 25630571. The reversal of 25630565 is 56503652.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (25630559) and next prime (25630571).
It can be written as a sum of positive squares in 2 ways, for example, as 6120676 + 19509889 = 2474^2 + 4417^2 .
It is a cyclic number.
It is not a de Polignac number, because 25630565 - 220 = 24581989 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2563052 + ... + 2563061.
It is an arithmetic number, because the mean of its divisors is an integer number (7689171).
Almost surely, 225630565 is an apocalyptic number.
It is an amenable number.
25630565 is a deficient number, since it is larger than the sum of its proper divisors (5126119).
25630565 is an equidigital number, since it uses as much as digits as its factorization.
25630565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5126118.
The product of its (nonzero) digits is 27000, while the sum is 32.
The square root of 25630565 is about 5062.6638245098. The cubic root of 25630565 is about 294.8397674316.
The spelling of 25630565 in words is "twenty-five million, six hundred thirty thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •