Base | Representation |
---|---|
bin | 110010110110… |
… | …0111100110000 |
3 | 1212011111112201 |
4 | 1211230330300 |
5 | 23311120111 |
6 | 2351232544 |
7 | 442416601 |
oct | 145547460 |
9 | 55144481 |
10 | 26660656 |
11 | 1405a600 |
12 | 8b18754 |
13 | 56a6049 |
14 | 377dda8 |
15 | 25196c1 |
hex | 196cf30 |
26660656 has 60 divisors (see below), whose sum is σ = 58183776. Its totient is φ = 11820160.
The previous prime is 26660653. The next prime is 26660671. The reversal of 26660656 is 65606662.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (26660653) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 90846 + ... + 91138.
Almost surely, 226660656 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 26660656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29091888).
26660656 is an abundant number, since it is smaller than the sum of its proper divisors (31523120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26660656 is a wasteful number, since it uses less digits than its factorization.
26660656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370 (or 353 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 37.
The square root of 26660656 is about 5163.3957818474. The cubic root of 26660656 is about 298.7378678920.
It can be divided in two parts, 266606 and 56, that added together give a palindrome (266662).
The spelling of 26660656 in words is "twenty-six million, six hundred sixty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •