Base | Representation |
---|---|
bin | 110010000110… |
… | …1010110011000 |
3 | 1211102121101220 |
4 | 1210031112120 |
5 | 23211102310 |
6 | 2335012040 |
7 | 436166145 |
oct | 144152630 |
9 | 54377356 |
10 | 26269080 |
11 | 13912392 |
12 | 896a020 |
13 | 5599a46 |
14 | 36bb3cc |
15 | 248d670 |
hex | 190d598 |
26269080 has 128 divisors (see below), whose sum is σ = 85017600. Its totient is φ = 6469632.
The previous prime is 26269051. The next prime is 26269081. The reversal of 26269080 is 8096262.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26269081) 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 31 ways as a sum of consecutive naturals, for example, 161079 + ... + 161241.
It is an arithmetic number, because the mean of its divisors is an integer number (664200).
Almost surely, 226269080 is an apocalyptic number.
26269080 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 26269080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42508800).
26269080 is an abundant number, since it is smaller than the sum of its proper divisors (58748520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26269080 is a wasteful number, since it uses less digits than its factorization.
26269080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273 (or 269 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 26269080 is about 5125.3370620867. The cubic root of 26269080 is about 297.2680865679.
The spelling of 26269080 in words is "twenty-six million, two hundred sixty-nine thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •