Base | Representation |
---|---|
bin | 10111011000011111… |
… | …001101010010110100 |
3 | 2101210202001110121222 |
4 | 113120133031102310 |
5 | 402404331133202 |
6 | 15311155525512 |
7 | 1546113044450 |
oct | 273037152264 |
9 | 71722043558 |
10 | 25106896052 |
11 | a714208677 |
12 | 4a482b9898 |
13 | 24a1722b14 |
14 | 1302651660 |
15 | 9be28a4a2 |
hex | 5d87cd4b4 |
25106896052 has 12 divisors (see below), whose sum is σ = 50213792160. Its totient is φ = 10760098296.
The previous prime is 25106896043. The next prime is 25106896057. The reversal of 25106896052 is 25069860152.
25106896052 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 25106895994 and 25106896012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25106896057) 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 3 ways as a sum of consecutive naturals, for example, 448337402 + ... + 448337457.
It is an arithmetic number, because the mean of its divisors is an integer number (4184482680).
Almost surely, 225106896052 is an apocalyptic number.
It is an amenable number.
25106896052 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25106896052 is a wasteful number, since it uses less digits than its factorization.
25106896052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896674870 (or 896674868 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 44.
The spelling of 25106896052 in words is "twenty-five billion, one hundred six million, eight hundred ninety-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •