Base | Representation |
---|---|
bin | 11000001111001101… |
… | …110101101111010000 |
3 | 2111011201210112221020 |
4 | 120033031311233100 |
5 | 411244410340000 |
6 | 15542235555440 |
7 | 1610632420650 |
oct | 301715655720 |
9 | 74151715836 |
10 | 26025090000 |
11 | 10045537348 |
12 | 50638bbb80 |
13 | 25b9a19850 |
14 | 138c586360 |
15 | a24bacba0 |
hex | 60f375bd0 |
26025090000 has 400 divisors, whose sum is σ = 103410797952. Its totient is φ = 5490432000.
The previous prime is 26025089989. The next prime is 26025090017. The reversal of 26025090000 is 9052062.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2725234 + ... + 2734766.
Almost surely, 226025090000 is an apocalyptic number.
26025090000 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 26025090000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51705398976).
26025090000 is an abundant number, since it is smaller than the sum of its proper divisors (77385707952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26025090000 is a wasteful number, since it uses less digits than its factorization.
26025090000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9584 (or 9563 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The spelling of 26025090000 in words is "twenty-six billion, twenty-five million, ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •