Base | Representation |
---|---|
bin | 11000001111101000… |
… | …110100111010000000 |
3 | 2111012020002222022000 |
4 | 120033220310322000 |
5 | 411303213230410 |
6 | 15543051344000 |
7 | 1611046514160 |
oct | 301750647200 |
9 | 74166088260 |
10 | 26032164480 |
11 | 10049529523 |
12 | 5066152000 |
13 | 25bb32592a |
14 | 138d4a85a0 |
15 | a25608dc0 |
hex | 60fa34e80 |
26032164480 has 1024 divisors, whose sum is σ = 113743872000. Its totient is φ = 5494210560.
The previous prime is 26032164469. The next prime is 26032164517. The reversal of 26032164480 is 8446123062.
26032164480 is a `hidden beast` number, since 2 + 6 + 0 + 3 + 2 + 1 + 644 + 8 + 0 = 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 polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 108017160 + ... + 108017400.
It is an arithmetic number, because the mean of its divisors is an integer number (111078000).
Almost surely, 226032164480 is an apocalyptic number.
26032164480 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 26032164480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56871936000).
26032164480 is an abundant number, since it is smaller than the sum of its proper divisors (87711707520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26032164480 is a wasteful number, since it uses less digits than its factorization.
26032164480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342 (or 324 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 36.
The spelling of 26032164480 in words is "twenty-six billion, thirty-two million, one hundred sixty-four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.390 sec. • engine limits •