Base | Representation |
---|---|
bin | 110011011011… |
… | …1100000101100 |
3 | 1212202000110222 |
4 | 1212313200230 |
5 | 23400403220 |
6 | 2401550512 |
7 | 445131152 |
oct | 146674054 |
9 | 55660428 |
10 | 26966060 |
11 | 14249000 |
12 | 9045438 |
13 | 5782064 |
14 | 381d3d2 |
15 | 2579e25 |
hex | 19b782c |
26966060 has 48 divisors (see below), whose sum is σ = 62348832. Its totient is φ = 9796160.
The previous prime is 26966039. The next prime is 26966077. The reversal of 26966060 is 6066962.
It is a self number, because there is not a number n which added to its sum of digits gives 26966060.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26114 + ... + 27126.
It is an arithmetic number, because the mean of its divisors is an integer number (1298934).
Almost surely, 226966060 is an apocalyptic number.
26966060 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 26966060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31174416).
26966060 is an abundant number, since it is smaller than the sum of its proper divisors (35382772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26966060 is a wasteful number, since it uses less digits than its factorization.
26966060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1055 (or 1031 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 35.
The square root of 26966060 is about 5192.8855177059. The cubic root of 26966060 is about 299.8742435881.
The spelling of 26966060 in words is "twenty-six million, nine hundred sixty-six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •