Base | Representation |
---|---|
bin | 11000010011110011… |
… | …000100000001000000 |
3 | 2111101002102210012000 |
4 | 120103303010001000 |
5 | 411424100103142 |
6 | 15554023304000 |
7 | 1612554654021 |
oct | 302363040100 |
9 | 74332383160 |
10 | 26101956672 |
11 | 10084968420 |
12 | 50855ab000 |
13 | 25cc92099c |
14 | 1398874c48 |
15 | a2b7e314c |
hex | 613cc4040 |
26101956672 has 224 divisors, whose sum is σ = 88636083840. Its totient is φ = 7444316160.
The previous prime is 26101956623. The next prime is 26101956677. The reversal of 26101956672 is 27665910162.
26101956672 is a `hidden beast` number, since 2 + 6 + 1 + 0 + 19 + 566 + 72 = 666.
It is not an unprimeable number, because it can be changed into a prime (26101956677) by changing a digit.
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, 282748 + ... + 363524.
Almost surely, 226101956672 is an apocalyptic number.
26101956672 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 26101956672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44318041920).
26101956672 is an abundant number, since it is smaller than the sum of its proper divisors (62534127168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26101956672 is a wasteful number, since it uses less digits than its factorization.
26101956672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80826 (or 80810 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The spelling of 26101956672 in words is "twenty-six billion, one hundred one million, nine hundred fifty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •