Base | Representation |
---|---|
bin | 110001110111… |
… | …1100111000100 |
3 | 1211012102022100 |
4 | 1203233213010 |
5 | 23143203033 |
6 | 2332232100 |
7 | 435151050 |
oct | 143574704 |
9 | 54172270 |
10 | 26147268 |
11 | 13839914 |
12 | 890b630 |
13 | 5556474 |
14 | 3688c60 |
15 | 2467513 |
hex | 18ef9c4 |
26147268 has 144 divisors (see below), whose sum is σ = 82001920. Its totient is φ = 6858432.
The previous prime is 26147263. The next prime is 26147273. The reversal of 26147268 is 86274162.
It is an interprime number because it is at equal distance from previous prime (26147263) and next prime (26147273).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (26147263) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 205821 + ... + 205947.
Almost surely, 226147268 is an apocalyptic number.
26147268 is a gapful number since it is divisible by the number (28) 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 26147268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41000960).
26147268 is an abundant number, since it is smaller than the sum of its proper divisors (55854652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26147268 is a wasteful number, since it uses less digits than its factorization.
26147268 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206 (or 201 counting only the distinct ones).
The product of its digits is 32256, while the sum is 36.
The square root of 26147268 is about 5113.4399380456. The cubic root of 26147268 is about 296.8078885493.
The spelling of 26147268 in words is "twenty-six million, one hundred forty-seven thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •