Base | Representation |
---|---|
bin | 10111010101110100… |
… | …000010101101000101 |
3 | 2101200121121211120011 |
4 | 113111310002231011 |
5 | 402311334313203 |
6 | 15302514110221 |
7 | 1545026464231 |
oct | 272564025505 |
9 | 71617554504 |
10 | 25062026053 |
11 | a6a0951129 |
12 | 4a3527b371 |
13 | 249534271c |
14 | 12da6d15c1 |
15 | 9ba37576d |
hex | 5d5d02b45 |
25062026053 has 4 divisors (see below), whose sum is σ = 25067782540. Its totient is φ = 25056269568.
The previous prime is 25062026051. The next prime is 25062026063. The reversal of 25062026053 is 35062026052.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21846909249 + 3215116804 = 147807^2 + 56702^2 .
It is a cyclic number.
It is not a de Polignac number, because 25062026053 - 21 = 25062026051 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 (25062026051) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2871708 + ... + 2880421.
It is an arithmetic number, because the mean of its divisors is an integer number (6266945635).
Almost surely, 225062026053 is an apocalyptic number.
It is an amenable number.
25062026053 is a deficient number, since it is larger than the sum of its proper divisors (5756487).
25062026053 is an equidigital number, since it uses as much as digits as its factorization.
25062026053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5756486.
The product of its (nonzero) digits is 21600, while the sum is 31.
Subtracting 25062026053 from its reverse (35062026052), we obtain a palindrome (9999999999).
The spelling of 25062026053 in words is "twenty-five billion, sixty-two million, twenty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •