Base | Representation |
---|---|
bin | 11000101101000001… |
… | …001111001110011000 |
3 | 2112110120122211211020 |
4 | 120231001033032120 |
5 | 413310411244000 |
6 | 20104021002440 |
7 | 1626213440544 |
oct | 305501171630 |
9 | 75416584736 |
10 | 26525103000 |
11 | 10281802530 |
12 | 5183253420 |
13 | 26694a7826 |
14 | 13d8b42a24 |
15 | a53a29ba0 |
hex | 62d04f398 |
26525103000 has 256 divisors, whose sum is σ = 91561466880. Its totient is φ = 6339200000.
The previous prime is 26525102999. The next prime is 26525103029. The reversal of 26525103000 is 30152562.
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 polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2337340 + ... + 2348660.
It is an arithmetic number, because the mean of its divisors is an integer number (357661980).
Almost surely, 226525103000 is an apocalyptic number.
26525103000 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 26525103000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45780733440).
26525103000 is an abundant number, since it is smaller than the sum of its proper divisors (65036363880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26525103000 is a wasteful number, since it uses less digits than its factorization.
26525103000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11427 (or 11413 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
Adding to 26525103000 its reverse (30152562), we get a palindrome (26555255562).
The spelling of 26525103000 in words is "twenty-six billion, five hundred twenty-five million, one hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •