Base | Representation |
---|---|
bin | 110001000001… |
… | …1100111111000 |
3 | 1210100221120021 |
4 | 1202003213320 |
5 | 23040024302 |
6 | 2314540224 |
7 | 431326360 |
oct | 142034770 |
9 | 53327507 |
10 | 25704952 |
11 | 13567569 |
12 | 8737674 |
13 | 5430040 |
14 | 35b19a0 |
15 | 23cb437 |
hex | 18839f8 |
25704952 has 128 divisors (see below), whose sum is σ = 65802240. Its totient is φ = 9123840.
The previous prime is 25704949. The next prime is 25704953. The reversal of 25704952 is 25940752.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25704953) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 383623 + ... + 383689.
It is an arithmetic number, because the mean of its divisors is an integer number (514080).
Almost surely, 225704952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25704952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32901120).
25704952 is an abundant number, since it is smaller than the sum of its proper divisors (40097288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25704952 is a wasteful number, since it uses less digits than its factorization.
25704952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141 (or 137 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 25704952 is about 5070.0051282025. The cubic root of 25704952 is about 295.1247274927.
The spelling of 25704952 in words is "twenty-five million, seven hundred four thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •