Base | Representation |
---|---|
bin | 110000101111… |
… | …0010010100000 |
3 | 1210002011210120 |
4 | 1201132102200 |
5 | 23020131112 |
6 | 2311400240 |
7 | 430121502 |
oct | 141362240 |
9 | 53064716 |
10 | 25552032 |
11 | 13472690 |
12 | 8683080 |
13 | 53a855c |
14 | 3571d72 |
15 | 239ae8c |
hex | 185e4a0 |
25552032 has 48 divisors (see below), whose sum is σ = 73174752. Its totient is φ = 7742720.
The previous prime is 25552027. The next prime is 25552073. The reversal of 25552032 is 23025552.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 25551993 and 25552011.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11043 + ... + 13154.
It is an arithmetic number, because the mean of its divisors is an integer number (1524474).
Almost surely, 225552032 is an apocalyptic number.
25552032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
25552032 is an abundant number, since it is smaller than the sum of its proper divisors (47622720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25552032 is a wasteful number, since it uses less digits than its factorization.
25552032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24221 (or 24213 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 24.
The square root of 25552032 is about 5054.9017794612. The cubic root of 25552032 is about 294.5383260250.
Adding to 25552032 its reverse (23025552), we get a palindrome (48577584).
It can be divided in two parts, 255520 and 32, that added together give a palindrome (255552).
The spelling of 25552032 in words is "twenty-five million, five hundred fifty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •