Base | Representation |
---|---|
bin | 110000111011… |
… | …1101010010000 |
3 | 1210021110100110 |
4 | 1201313222100 |
5 | 23031442302 |
6 | 2313521320 |
7 | 431033460 |
oct | 141675220 |
9 | 53243313 |
10 | 25655952 |
11 | 13533773 |
12 | 8713240 |
13 | 541394a |
14 | 359bba0 |
15 | 23bbb6c |
hex | 1877a90 |
25655952 has 80 divisors (see below), whose sum is σ = 78387840. Its totient is φ = 7074816.
The previous prime is 25655951. The next prime is 25655953. The reversal of 25655952 is 25955652.
It is an interprime number because it is at equal distance from previous prime (25655951) and next prime (25655953).
It is a self number, because there is not a number n which added to its sum of digits gives 25655952.
It is not an unprimeable number, because it can be changed into a prime (25655951) 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, 8428 + ... + 11060.
It is an arithmetic number, because the mean of its divisors is an integer number (979848).
Almost surely, 225655952 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 25655952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39193920).
25655952 is an abundant number, since it is smaller than the sum of its proper divisors (52731888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25655952 is a wasteful number, since it uses less digits than its factorization.
25655952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2680 (or 2674 counting only the distinct ones).
The product of its digits is 135000, while the sum is 39.
The square root of 25655952 is about 5065.1704808427. The cubic root of 25655952 is about 294.9370812860.
The spelling of 25655952 in words is "twenty-five million, six hundred fifty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •