Base | Representation |
---|---|
bin | 110000110111… |
… | …1101110100000 |
3 | 1210012210202220 |
4 | 1201233232200 |
5 | 23024422311 |
6 | 2313111040 |
7 | 430536645 |
oct | 141575640 |
9 | 53183686 |
10 | 25623456 |
11 | 13511311 |
12 | 86b8480 |
13 | 5401c11 |
14 | 358ddcc |
15 | 23b2206 |
hex | 186fba0 |
25623456 has 48 divisors (see below), whose sum is σ = 68040000. Its totient is φ = 8442368.
The previous prime is 25623407. The next prime is 25623461. The reversal of 25623456 is 65432652.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×256234562 = 1313122994767872, which contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 7045 + ... + 10043.
It is an arithmetic number, because the mean of its divisors is an integer number (1417500).
Almost surely, 225623456 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 25623456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34020000).
25623456 is an abundant number, since it is smaller than the sum of its proper divisors (42416544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25623456 is a wasteful number, since it uses less digits than its factorization.
25623456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3101 (or 3093 counting only the distinct ones).
The product of its digits is 43200, while the sum is 33.
The square root of 25623456 is about 5061.9616750821. The cubic root of 25623456 is about 294.8125055833.
The spelling of 25623456 in words is "twenty-five million, six hundred twenty-three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •