Base | Representation |
---|---|
bin | 10111101111111100… |
… | …101100000000111100 |
3 | 2102211011200121210000 |
4 | 113233330230000330 |
5 | 404211112000103 |
6 | 15414220114300 |
7 | 1561632450063 |
oct | 275774540074 |
9 | 72734617700 |
10 | 25500500028 |
11 | a8a6405113 |
12 | 4b38095990 |
13 | 2535135093 |
14 | 133ca2d1da |
15 | 9e3ad8aa3 |
hex | 5eff2c03c |
25500500028 has 60 divisors (see below), whose sum is σ = 66753696240. Its totient is φ = 8488646208.
The previous prime is 25500500017. The next prime is 25500500029. The reversal of 25500500028 is 82000500552.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 25500499974 and 25500500010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25500500029) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 187768 + ... + 293696.
It is an arithmetic number, because the mean of its divisors is an integer number (1112561604).
Almost surely, 225500500028 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 25500500028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33376848120).
25500500028 is an abundant number, since it is smaller than the sum of its proper divisors (41253196212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25500500028 is a wasteful number, since it uses less digits than its factorization.
25500500028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106688 (or 106677 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The spelling of 25500500028 in words is "twenty-five billion, five hundred million, five hundred thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •