Base | Representation |
---|---|
bin | 110011000001… |
… | …1111111011100 |
3 | 1212100022000021 |
4 | 1212003333130 |
5 | 23322130121 |
6 | 2353241524 |
7 | 443262010 |
oct | 146037734 |
9 | 55308007 |
10 | 26755036 |
11 | 14114500 |
12 | 8b632a4 |
13 | 5709ca9 |
14 | 37a6540 |
15 | 2537641 |
hex | 1983fdc |
26755036 has 72 divisors (see below), whose sum is σ = 60328800. Its totient is φ = 10158720.
The previous prime is 26755007. The next prime is 26755039. The reversal of 26755036 is 63055762.
It is a super-2 number, since 2×267550362 = 1431663902722592, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 26754992 and 26755010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26755039) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 179490 + ... + 179638.
It is an arithmetic number, because the mean of its divisors is an integer number (837900).
Almost surely, 226755036 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 26755036, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30164400).
26755036 is an abundant number, since it is smaller than the sum of its proper divisors (33573764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26755036 is a wasteful number, since it uses less digits than its factorization.
26755036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235 (or 222 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 34.
The square root of 26755036 is about 5172.5270419786. The cubic root of 26755036 is about 299.0899681909.
The spelling of 26755036 in words is "twenty-six million, seven hundred fifty-five thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •