Base | Representation |
---|---|
bin | 10111110000010001… |
… | …111010110001110101 |
3 | 2102211120011101012112 |
4 | 113300101322301311 |
5 | 404214023044100 |
6 | 15414535300405 |
7 | 1562030660033 |
oct | 276021726165 |
9 | 72746141175 |
10 | 25506065525 |
11 | a8a95665a6 |
12 | 4b39b1a705 |
13 | 2536333385 |
14 | 133d67b553 |
15 | 9e4337b35 |
hex | 5f047ac75 |
25506065525 has 6 divisors (see below), whose sum is σ = 31627521282. Its totient is φ = 20404852400.
The previous prime is 25506065521. The next prime is 25506065539. The reversal of 25506065525 is 52556060552.
It can be written as a sum of positive squares in 3 ways, for example, as 1219336561 + 24286728964 = 34919^2 + 155842^2 .
It is not a de Polignac number, because 25506065525 - 22 = 25506065521 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25506065521) by changing a digit.
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, 510121286 + ... + 510121335.
It is an arithmetic number, because the mean of its divisors is an integer number (5271253547).
Almost surely, 225506065525 is an apocalyptic number.
25506065525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
25506065525 is a deficient number, since it is larger than the sum of its proper divisors (6121455757).
25506065525 is a wasteful number, since it uses less digits than its factorization.
25506065525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020242631 (or 1020242626 counting only the distinct ones).
The product of its (nonzero) digits is 450000, while the sum is 41.
The spelling of 25506065525 in words is "twenty-five billion, five hundred six million, sixty-five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •