Base | Representation |
---|---|
bin | 11010101000011000… |
… | …111000011000111000 |
3 | 2201210211100100110101 |
4 | 122220120320120320 |
5 | 432030243222423 |
6 | 21045235525144 |
7 | 2031415424662 |
oct | 325030703070 |
9 | 81724310411 |
10 | 28594898488 |
11 | 11144090512 |
12 | 56604597b4 |
13 | 290924b5a0 |
14 | 15539a9532 |
15 | b255c77ad |
hex | 6a8638638 |
28594898488 has 64 divisors (see below), whose sum is σ = 60376296960. Its totient is φ = 12597399936.
The previous prime is 28594898417. The next prime is 28594898503. The reversal of 28594898488 is 88489849582.
It is a super-2 number, since 2×285948984882 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 28594898488.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1152631 + ... + 1177177.
It is an arithmetic number, because the mean of its divisors is an integer number (943379640).
Almost surely, 228594898488 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 28594898488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30188148480).
28594898488 is an abundant number, since it is smaller than the sum of its proper divisors (31781398472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28594898488 is a wasteful number, since it uses less digits than its factorization.
28594898488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25076 (or 25072 counting only the distinct ones).
The product of its digits is 424673280, while the sum is 73.
The spelling of 28594898488 in words is "twenty-eight billion, five hundred ninety-four million, eight hundred ninety-eight thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •