Base | Representation |
---|---|
bin | 11000010111111100… |
… | …110000011001110000 |
3 | 2111112221111100222110 |
4 | 120113330300121300 |
5 | 412044412403030 |
6 | 20004552205320 |
7 | 1614361662114 |
oct | 302774603160 |
9 | 74487440873 |
10 | 26171606640 |
11 | 1011020a483 |
12 | 50a4999840 |
13 | 261119909a |
14 | 13a3c05744 |
15 | a329a01b0 |
hex | 617f30670 |
26171606640 has 160 divisors (see below), whose sum is σ = 84381742080. Its totient is φ = 6704335872.
The previous prime is 26171606633. The next prime is 26171606653. The reversal of 26171606640 is 4660617162.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 682867 + ... + 720173.
It is an arithmetic number, because the mean of its divisors is an integer number (527385888).
Almost surely, 226171606640 is an apocalyptic number.
26171606640 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 26171606640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42190871040).
26171606640 is an abundant number, since it is smaller than the sum of its proper divisors (58210135440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26171606640 is a wasteful number, since it uses less digits than its factorization.
26171606640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37439 (or 37433 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 39.
The spelling of 26171606640 in words is "twenty-six billion, one hundred seventy-one million, six hundred six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •