Base | Representation |
---|---|
bin | 11010000101000011… |
… | …000001110001011000 |
3 | 2200021111122022122000 |
4 | 122011003001301120 |
5 | 424322000422232 |
6 | 20510335201000 |
7 | 2010625536213 |
oct | 320503016130 |
9 | 80244568560 |
10 | 28001967192 |
11 | 1096a420451 |
12 | 5515976160 |
13 | 2843459274 |
14 | 14d8d4277a |
15 | add50427c |
hex | 6850c1c58 |
28001967192 has 128 divisors (see below), whose sum is σ = 79608960000. Its totient is φ = 9115763328.
The previous prime is 28001967127. The next prime is 28001967241. The reversal of 28001967192 is 29176910082.
It is a super-4 number, since 4×280019671924 (a number of 43 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5164659 + ... + 5170077.
It is an arithmetic number, because the mean of its divisors is an integer number (621945000).
Almost surely, 228001967192 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 28001967192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39804480000).
28001967192 is an abundant number, since it is smaller than the sum of its proper divisors (51606992808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28001967192 is a wasteful number, since it uses less digits than its factorization.
28001967192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5990 (or 5980 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 45.
The spelling of 28001967192 in words is "twenty-eight billion, one million, nine hundred sixty-seven thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •