Base | Representation |
---|---|
bin | 11001001000000101… |
… | …100110101110000000 |
3 | 2120122020012000120112 |
4 | 121020011212232000 |
5 | 420223140421030 |
6 | 20221042330452 |
7 | 1643366456633 |
oct | 311005465600 |
9 | 76566160515 |
10 | 26979232640 |
11 | 10495089888 |
12 | 528b359a28 |
13 | 270c5bc0a9 |
14 | 143d197c1a |
15 | a7d831a95 |
hex | 648166b80 |
26979232640 has 64 divisors (see below), whose sum is σ = 64639060560. Its totient is φ = 10767962112.
The previous prime is 26979232639. The next prime is 26979232667. The reversal of 26979232640 is 4623297962.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
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, 246359 + ... + 338601.
Almost surely, 226979232640 is an apocalyptic number.
26979232640 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 26979232640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32319530280).
26979232640 is an abundant number, since it is smaller than the sum of its proper divisors (37659827920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26979232640 is an equidigital number, since it uses as much as digits as its factorization.
26979232640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92719 (or 92707 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 50.
The spelling of 26979232640 in words is "twenty-six billion, nine hundred seventy-nine million, two hundred thirty-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •