Base | Representation |
---|---|
bin | 110011011001… |
… | …0100110100000 |
3 | 1212200222220020 |
4 | 1212302212200 |
5 | 23344232302 |
6 | 2401313440 |
7 | 445015425 |
oct | 146624640 |
9 | 55628806 |
10 | 26945952 |
11 | 14234990 |
12 | 9035880 |
13 | 5775b67 |
14 | 3815d4c |
15 | 2573ebc |
hex | 19b29a0 |
26945952 has 192 divisors, whose sum is σ = 87091200. Its totient is φ = 7188480.
The previous prime is 26945929. The next prime is 26945981. The reversal of 26945952 is 25954962.
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 31 ways as a sum of consecutive naturals, for example, 341049 + ... + 341127.
It is an arithmetic number, because the mean of its divisors is an integer number (453600).
Almost surely, 226945952 is an apocalyptic number.
26945952 is a gapful number since it is divisible by the number (22) 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 26945952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43545600).
26945952 is an abundant number, since it is smaller than the sum of its proper divisors (60145248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26945952 is a wasteful number, since it uses less digits than its factorization.
26945952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139 (or 131 counting only the distinct ones).
The product of its digits is 194400, while the sum is 42.
The square root of 26945952 is about 5190.9490461764. The cubic root of 26945952 is about 299.7996885030.
It can be divided in two parts, 2694 and 5952, that added together give a triangular number (8646 = T131).
The spelling of 26945952 in words is "twenty-six million, nine hundred forty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •