Base | Representation |
---|---|
bin | 110000100110… |
… | …1000110100000 |
3 | 1202221121020011 |
4 | 1201031012200 |
5 | 23010403012 |
6 | 2310054304 |
7 | 426406321 |
oct | 141150640 |
9 | 52847204 |
10 | 25481632 |
11 | 13424800 |
12 | 864a394 |
13 | 53824b7 |
14 | 3554448 |
15 | 23851a7 |
hex | 184d1a0 |
25481632 has 36 divisors (see below), whose sum is σ = 55150578. Its totient is φ = 11580800.
The previous prime is 25481629. The next prime is 25481639. The reversal of 25481632 is 23618452.
It can be written as a sum of positive squares in only one way, i.e., 23853456 + 1628176 = 4884^2 + 1276^2 .
It is a junction number, because it is equal to n+sod(n) for n = 25481594 and 25481603.
It is not an unprimeable number, because it can be changed into a prime (25481639) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 582 + ... + 7162.
Almost surely, 225481632 is an apocalyptic number.
25481632 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25481632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27575289).
25481632 is an abundant number, since it is smaller than the sum of its proper divisors (29668946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25481632 is a wasteful number, since it uses less digits than its factorization.
25481632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6613 (or 6594 counting only the distinct ones).
The product of its digits is 11520, while the sum is 31.
The square root of 25481632 is about 5047.9334385469. The cubic root of 25481632 is about 294.2675769044.
The spelling of 25481632 in words is "twenty-five million, four hundred eighty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •