Base | Representation |
---|---|
bin | 110001001101… |
… | …1111000101100 |
3 | 1210112222220000 |
4 | 1202123320230 |
5 | 23101214312 |
6 | 2321024300 |
7 | 432222201 |
oct | 142337054 |
9 | 53488800 |
10 | 25804332 |
11 | 136251a4 |
12 | 8785090 |
13 | 5466348 |
14 | 35d9ca8 |
15 | 23eaadc |
hex | 189be2c |
25804332 has 60 divisors (see below), whose sum is σ = 68444376. Its totient is φ = 8475840.
The previous prime is 25804327. The next prime is 25804357. The reversal of 25804332 is 23340852.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 25804296 and 25804305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 23107 + ... + 24197.
Almost surely, 225804332 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 25804332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34222188).
25804332 is an abundant number, since it is smaller than the sum of its proper divisors (42640044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25804332 is a wasteful number, since it uses less digits than its factorization.
25804332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1180 (or 1169 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 25804332 is about 5079.7964526150. The cubic root of 25804332 is about 295.5045736106.
It can be divided in two parts, 25 and 804332, that added together give a cube (804357 = 933).
The spelling of 25804332 in words is "twenty-five million, eight hundred four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •