Base | Representation |
---|---|
bin | 11010111011011001… |
… | …111010100101101110 |
3 | 2202122001200011200022 |
4 | 122323121322211232 |
5 | 433203431434000 |
6 | 21141034002142 |
7 | 2042341256456 |
oct | 327331724556 |
9 | 82561604608 |
10 | 28913936750 |
11 | 112981886a6 |
12 | 572b276352 |
13 | 295a383b1a |
14 | 15840d6d66 |
15 | b435e7585 |
hex | 6bb67a96e |
28913936750 has 32 divisors (see below), whose sum is σ = 55589796288. Its totient is φ = 11252988000.
The previous prime is 28913936699. The next prime is 28913936791. The reversal of 28913936750 is 5763931982.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 28913936692 and 28913936701.
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, 1553666 + ... + 1572165.
It is an arithmetic number, because the mean of its divisors is an integer number (1737181134).
Almost surely, 228913936750 is an apocalyptic number.
28913936750 is a deficient number, since it is larger than the sum of its proper divisors (26675859538).
28913936750 is a wasteful number, since it uses less digits than its factorization.
28913936750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3125885 (or 3125875 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 53.
The spelling of 28913936750 in words is "twenty-eight billion, nine hundred thirteen million, nine hundred thirty-six thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •