Base | Representation |
---|---|
bin | 110001110101… |
… | …0010110100000 |
3 | 1211011022202120 |
4 | 1203222112200 |
5 | 23142010403 |
6 | 2331544240 |
7 | 435031206 |
oct | 143522640 |
9 | 54138676 |
10 | 26125728 |
11 | 13824712 |
12 | 88bb080 |
13 | 5549715 |
14 | 3681076 |
15 | 2460e53 |
hex | 18ea5a0 |
26125728 has 48 divisors (see below), whose sum is σ = 69564096. Its totient is φ = 8583680.
The previous prime is 26125727. The next prime is 26125739. The reversal of 26125728 is 82752162.
It is a tau number, because it is divible by the number of its divisors (48).
It is not an unprimeable number, because it can be changed into a prime (26125727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4900 + ... + 8732.
It is an arithmetic number, because the mean of its divisors is an integer number (1449252).
Almost surely, 226125728 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 26125728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34782048).
26125728 is an abundant number, since it is smaller than the sum of its proper divisors (43438368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26125728 is a wasteful number, since it uses less digits than its factorization.
26125728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3917 (or 3909 counting only the distinct ones).
The product of its digits is 13440, while the sum is 33.
The square root of 26125728 is about 5111.3332898570. Note that the first 3 decimals coincide. The cubic root of 26125728 is about 296.7263631639.
The spelling of 26125728 in words is "twenty-six million, one hundred twenty-five thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •