Base | Representation |
---|---|
bin | 1100001000011111011101… |
… | …00100100001110001111000 |
3 | 10111110120212011120101100202 |
4 | 12010033232210201301320 |
5 | 11444111212333202113 |
6 | 132424350533221332 |
7 | 5422366241553440 |
oct | 604175644416170 |
9 | 114416764511322 |
10 | 26680044428408 |
11 | 8556a41594858 |
12 | 2baa930a91848 |
13 | 11b6bc0690227 |
14 | 68346cd13120 |
15 | 314020ed4258 |
hex | 1843ee921c78 |
26680044428408 has 64 divisors (see below), whose sum is σ = 57652980940800. Its totient is φ = 11338213760640.
The previous prime is 26680044428393. The next prime is 26680044428423. The reversal of 26680044428408 is 80482444008662.
It is an interprime number because it is at equal distance from previous prime (26680044428393) and next prime (26680044428423).
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4303241 + ... + 8478087.
It is an arithmetic number, because the mean of its divisors is an integer number (900827827200).
Almost surely, 226680044428408 is an apocalyptic number.
26680044428408 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
26680044428408 is an abundant number, since it is smaller than the sum of its proper divisors (30972936512392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26680044428408 is a wasteful number, since it uses less digits than its factorization.
26680044428408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4175820 (or 4175816 counting only the distinct ones).
The product of its (nonzero) digits is 18874368, while the sum is 56.
The spelling of 26680044428408 in words is "twenty-six trillion, six hundred eighty billion, forty-four million, four hundred twenty-eight thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •