Base | Representation |
---|---|
bin | 101111110011… |
… | …0011100100000 |
3 | 1202011020102211 |
4 | 1133212130200 |
5 | 22403424102 |
6 | 2253051504 |
7 | 423005404 |
oct | 137463440 |
9 | 52136384 |
10 | 25061152 |
11 | 131678a6 |
12 | 8486b94 |
13 | 5265cac |
14 | 3485104 |
15 | 23007d7 |
hex | 17e6720 |
25061152 has 48 divisors (see below), whose sum is σ = 53101440. Its totient is φ = 11605248.
The previous prime is 25061147. The next prime is 25061159. The reversal of 25061152 is 25116052.
It is a super-2 number, since 2×250611522 = 1256122679134208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (25061159) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 28138 + ... + 29014.
It is an arithmetic number, because the mean of its divisors is an integer number (1106280).
Almost surely, 225061152 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 25061152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26550720).
25061152 is an abundant number, since it is smaller than the sum of its proper divisors (28040288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25061152 is a wasteful number, since it uses less digits than its factorization.
25061152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953 (or 945 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 25061152 is about 5006.1114649996. Note that the first 3 decimals coincide. The cubic root of 25061152 is about 292.6399924031.
The spelling of 25061152 in words is "twenty-five million, sixty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •