Base | Representation |
---|---|
bin | 110011011011… |
… | …1101010100000 |
3 | 1212202001100020 |
4 | 1212313222200 |
5 | 23400413223 |
6 | 2401553440 |
7 | 445133040 |
oct | 146675240 |
9 | 55661306 |
10 | 26966688 |
11 | 14249521 |
12 | 9045880 |
13 | 5782428 |
14 | 381d720 |
15 | 257a1e3 |
hex | 19b7aa0 |
26966688 has 48 divisors (see below), whose sum is σ = 80902080. Its totient is φ = 7704576.
The previous prime is 26966677. The next prime is 26966699. The reversal of 26966688 is 88666962.
It is an interprime number because it is at equal distance from previous prime (26966677) and next prime (26966699).
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 26966688.
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 7 ways as a sum of consecutive naturals, for example, 19393 + ... + 20736.
It is an arithmetic number, because the mean of its divisors is an integer number (1685460).
Almost surely, 226966688 is an apocalyptic number.
26966688 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
26966688 is an abundant number, since it is smaller than the sum of its proper divisors (53935392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26966688 is a wasteful number, since it uses less digits than its factorization.
26966688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40149 (or 40141 counting only the distinct ones).
The product of its digits is 1492992, while the sum is 51.
The square root of 26966688 is about 5192.9459846989. The cubic root of 26966688 is about 299.8765714472.
The spelling of 26966688 in words is "twenty-six million, nine hundred sixty-six thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •