Base | Representation |
---|---|
bin | 110000101111… |
… | …0010100000000 |
3 | 1210002011221010 |
4 | 1201132110000 |
5 | 23020132003 |
6 | 2311400520 |
7 | 430122000 |
oct | 141362400 |
9 | 53064833 |
10 | 25552128 |
11 | 13472768 |
12 | 8683140 |
13 | 53a8604 |
14 | 3572000 |
15 | 239b003 |
hex | 185e500 |
25552128 has 144 divisors (see below), whose sum is σ = 80124800. Its totient is φ = 7225344.
The previous prime is 25552123. The next prime is 25552147. The reversal of 25552128 is 82125552.
It is a super-2 number, since 2×255521282 = 1305822490656768, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 25552095 and 25552104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25552123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 263376 + ... + 263472.
Almost surely, 225552128 is an apocalyptic number.
25552128 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25552128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40062400).
25552128 is an abundant number, since it is smaller than the sum of its proper divisors (54572672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25552128 is an frugal number, since it uses more digits than its factorization.
25552128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137 (or 109 counting only the distinct ones).
The product of its digits is 8000, while the sum is 30.
The square root of 25552128 is about 5054.9112751857. The cubic root of 25552128 is about 294.5386948886.
The spelling of 25552128 in words is "twenty-five million, five hundred fifty-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •