Base | Representation |
---|---|
bin | 110001111001… |
… | …0001100100100 |
3 | 1211012221211122 |
4 | 1203302030210 |
5 | 23144022420 |
6 | 2332353112 |
7 | 435223661 |
oct | 143621444 |
9 | 54187748 |
10 | 26157860 |
11 | 13846873 |
12 | 8915798 |
13 | 555b231 |
14 | 368ca68 |
15 | 246a725 |
hex | 18f2324 |
26157860 has 12 divisors (see below), whose sum is σ = 54931548. Its totient is φ = 10463136.
The previous prime is 26157841. The next prime is 26157863. The reversal of 26157860 is 6875162.
It can be written as a sum of positive squares in 2 ways, for example, as 20214016 + 5943844 = 4496^2 + 2438^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 26157860.
It is not an unprimeable number, because it can be changed into a prime (26157863) 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 3 ways as a sum of consecutive naturals, for example, 653927 + ... + 653966.
It is an arithmetic number, because the mean of its divisors is an integer number (4577629).
Almost surely, 226157860 is an apocalyptic number.
26157860 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26157860 is an abundant number, since it is smaller than the sum of its proper divisors (28773688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26157860 is a wasteful number, since it uses less digits than its factorization.
26157860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1307902 (or 1307900 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 35.
The square root of 26157860 is about 5114.4755351844. The cubic root of 26157860 is about 296.8479611201.
The spelling of 26157860 in words is "twenty-six million, one hundred fifty-seven thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •