Base | Representation |
---|---|
bin | 11000011010011010… |
… | …011011100110110000 |
3 | 2111122211021022222100 |
4 | 120122122123212300 |
5 | 412141003041313 |
6 | 20013030140400 |
7 | 1615403213130 |
oct | 303232334660 |
9 | 74584238870 |
10 | 26212940208 |
11 | 10131580a54 |
12 | 50b67b1700 |
13 | 261990b910 |
14 | 13a94c4ac0 |
15 | a36417173 |
hex | 61a69b9b0 |
26212940208 has 480 divisors, whose sum is σ = 95904972800. Its totient is φ = 6490036224.
The previous prime is 26212940197. The next prime is 26212940233. The reversal of 26212940208 is 80204921262.
26212940208 is a `hidden beast` number, since 2 + 621 + 2 + 9 + 4 + 0 + 20 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 95 ways as a sum of consecutive naturals, for example, 31619538 + ... + 31620366.
Almost surely, 226212940208 is an apocalyptic number.
26212940208 is a gapful number since it is divisible by the number (28) 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 26212940208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47952486400).
26212940208 is an abundant number, since it is smaller than the sum of its proper divisors (69692032592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26212940208 is a wasteful number, since it uses less digits than its factorization.
26212940208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009 (or 1000 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 26212940208 in words is "twenty-six billion, two hundred twelve million, nine hundred forty thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •