Base | Representation |
---|---|
bin | 11000010011111000… |
… | …110110000000000000 |
3 | 2111101012021210000000 |
4 | 120103320312000000 |
5 | 411424442102003 |
6 | 15554120000000 |
7 | 1612603565166 |
oct | 302370660000 |
9 | 74335253000 |
10 | 26103472128 |
11 | 10085802a68 |
12 | 5086000000 |
13 | 26000316c6 |
14 | 1398b4b236 |
15 | a2b9e21a3 |
hex | 613e36000 |
26103472128 has 448 divisors, whose sum is σ = 82538864640. Its totient is φ = 8241315840.
The previous prime is 26103472121. The next prime is 26103472151. The reversal of 26103472128 is 82127430162.
It is a happy number.
26103472128 is a `hidden beast` number, since 2 + 61 + 0 + 3 + 472 + 128 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 26103472092 and 26103472101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26103472121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 555393001 + ... + 555393047.
Almost surely, 226103472128 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 26103472128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41269432320).
26103472128 is an abundant number, since it is smaller than the sum of its proper divisors (56435392512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26103472128 is an frugal number, since it uses more digits than its factorization.
26103472128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125 (or 83 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The spelling of 26103472128 in words is "twenty-six billion, one hundred three million, four hundred seventy-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •