Base | Representation |
---|---|
bin | 110000101001… |
… | …0000101011000 |
3 | 1202222122020000 |
4 | 1201102011120 |
5 | 23012031130 |
6 | 2310333000 |
7 | 426522654 |
oct | 141220530 |
9 | 52878200 |
10 | 25502040 |
11 | 13439073 |
12 | 865a160 |
13 | 538b885 |
14 | 355ba64 |
15 | 238b260 |
hex | 1852158 |
25502040 has 160 divisors (see below), whose sum is σ = 90953280. Its totient is φ = 6386688.
The previous prime is 25502033. The next prime is 25502111. The reversal of 25502040 is 4020552.
25502040 = T49 + T50 + ... + T534.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 54849 + ... + 55311.
It is an arithmetic number, because the mean of its divisors is an integer number (568458).
Almost surely, 225502040 is an apocalyptic number.
25502040 is a gapful number since it is divisible by the number (20) 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 25502040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45476640).
25502040 is an abundant number, since it is smaller than the sum of its proper divisors (65451240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25502040 is a wasteful number, since it uses less digits than its factorization.
25502040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503 (or 490 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 18.
The square root of 25502040 is about 5049.9544552402. The cubic root of 25502040 is about 294.3461146553.
Adding to 25502040 its reverse (4020552), we get a palindrome (29522592).
The spelling of 25502040 in words is "twenty-five million, five hundred two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •