Base | Representation |
---|---|
bin | 11000010000000001… |
… | …000000101011011000 |
3 | 2111012200001001200200 |
4 | 120100001000223120 |
5 | 411311324113102 |
6 | 15543435302200 |
7 | 1611154430163 |
oct | 302001005330 |
9 | 74180031620 |
10 | 26038504152 |
11 | 10052069621 |
12 | 50682aa960 |
13 | 25bc73540b |
14 | 1390278ada |
15 | a25e5c51c |
hex | 610040ad8 |
26038504152 has 72 divisors (see below), whose sum is σ = 71072355900. Its totient is φ = 8611716672.
The previous prime is 26038504127. The next prime is 26038504183. The reversal of 26038504152 is 25140583062.
26038504152 is a `hidden beast` number, since 2 + 603 + 8 + 5 + 0 + 41 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-3 number, since 3×260385041523 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 16142098 + ... + 16143710.
Almost surely, 226038504152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26038504152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35536177950).
26038504152 is an abundant number, since it is smaller than the sum of its proper divisors (45033851748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26038504152 is a wasteful number, since it uses less digits than its factorization.
26038504152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3377 (or 1757 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 26038504152 in words is "twenty-six billion, thirty-eight million, five hundred four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •