Base | Representation |
---|---|
bin | 110011011100… |
… | …1110001101100 |
3 | 1212202111012200 |
4 | 1212321301230 |
5 | 23401202330 |
6 | 2402101500 |
7 | 445200210 |
oct | 146716154 |
9 | 55674180 |
10 | 26975340 |
11 | 14254a77 |
12 | 904a890 |
13 | 5786352 |
14 | 3822940 |
15 | 257ca60 |
hex | 19b9c6c |
26975340 has 144 divisors (see below), whose sum is σ = 95047680. Its totient is φ = 6065280.
The previous prime is 26975317. The next prime is 26975341. The reversal of 26975340 is 4357962.
26975340 = T245 + T246 + ... + T560.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 26975295 and 26975304.
It is not an unprimeable number, because it can be changed into a prime (26975341) 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, 99405 + ... + 99675.
Almost surely, 226975340 is an apocalyptic number.
26975340 is a gapful number since it is divisible by the number (20) 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 26975340, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47523840).
26975340 is an abundant number, since it is smaller than the sum of its proper divisors (68072340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26975340 is a wasteful number, since it uses less digits than its factorization.
26975340 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 372 (or 367 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The square root of 26975340 is about 5193.7789710383. The cubic root of 26975340 is about 299.9086388466.
The spelling of 26975340 in words is "twenty-six million, nine hundred seventy-five thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •