Base | Representation |
---|---|
bin | 110010110111… |
… | …0010110000000 |
3 | 1212011210101021 |
4 | 1211232112000 |
5 | 23311310433 |
6 | 2351315224 |
7 | 442442341 |
oct | 145562600 |
9 | 55153337 |
10 | 26666368 |
11 | 14063923 |
12 | 8b1bb14 |
13 | 56a8821 |
14 | 37820c8 |
15 | 251b22d |
hex | 196e580 |
26666368 has 32 divisors (see below), whose sum is σ = 53464320. Its totient is φ = 13248000.
The previous prime is 26666347. The next prime is 26666377. The reversal of 26666368 is 86366662.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×266663682 = 1422190364622848, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 22593 + ... + 23743.
It is an arithmetic number, because the mean of its divisors is an integer number (1670760).
Almost surely, 226666368 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 26666368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26732160).
26666368 is an abundant number, since it is smaller than the sum of its proper divisors (26797952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26666368 is a wasteful number, since it uses less digits than its factorization.
26666368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1346 (or 1334 counting only the distinct ones).
The product of its digits is 373248, while the sum is 43.
The square root of 26666368 is about 5163.9488765866. The cubic root of 26666368 is about 298.7592010611.
The spelling of 26666368 in words is "twenty-six million, six hundred sixty-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •