Base | Representation |
---|---|
bin | 110000100101… |
… | …0010110010000 |
3 | 1202221000202101 |
4 | 1201022112100 |
5 | 23010022402 |
6 | 2305530144 |
7 | 426331405 |
oct | 141122620 |
9 | 52830671 |
10 | 25470352 |
11 | 13417286 |
12 | 8643954 |
13 | 537a31b |
14 | 35502ac |
15 | 2381b87 |
hex | 184a590 |
25470352 has 40 divisors (see below), whose sum is σ = 54070200. Its totient is φ = 11569152.
The previous prime is 25470343. The next prime is 25470353. The reversal of 25470352 is 25307452.
It can be written as a sum of positive squares in 4 ways, for example, as 4822416 + 20647936 = 2196^2 + 4544^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 25470352.
It is not an unprimeable number, because it can be changed into a prime (25470353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6274 + ... + 9502.
It is an arithmetic number, because the mean of its divisors is an integer number (1351755).
Almost surely, 225470352 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 25470352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27035100).
25470352 is an abundant number, since it is smaller than the sum of its proper divisors (28599848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25470352 is a wasteful number, since it uses less digits than its factorization.
25470352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3283 (or 3277 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 28.
The square root of 25470352 is about 5046.8160259712. The cubic root of 25470352 is about 294.2241491760.
The spelling of 25470352 in words is "twenty-five million, four hundred seventy thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •