Base | Representation |
---|---|
bin | 110001110000… |
… | …1111000110100 |
3 | 1211002120012120 |
4 | 1203201320310 |
5 | 23134403220 |
6 | 2331115540 |
7 | 434525142 |
oct | 143417064 |
9 | 54076176 |
10 | 26091060 |
11 | 13800666 |
12 | 88a2bb0 |
13 | 55369c8 |
14 | 3672592 |
15 | 2455a40 |
hex | 18e1e34 |
26091060 has 48 divisors (see below), whose sum is σ = 73824576. Its totient is φ = 6884352.
The previous prime is 26091053. The next prime is 26091061. The reversal of 26091060 is 6019062.
It is a self number, because there is not a number n which added to its sum of digits gives 26091060.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26091061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3579 + ... + 8061.
It is an arithmetic number, because the mean of its divisors is an integer number (1538012).
Almost surely, 226091060 is an apocalyptic number.
26091060 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 26091060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36912288).
26091060 is an abundant number, since it is smaller than the sum of its proper divisors (47733516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26091060 is a wasteful number, since it uses less digits than its factorization.
26091060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4592 (or 4590 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 26091060 is about 5107.9408767134. The cubic root of 26091060 is about 296.5950562896.
The spelling of 26091060 in words is "twenty-six million, ninety-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •