Base | Representation |
---|---|
bin | 1100110001010100000000… |
… | …11011010100101010010000 |
3 | 10200102200020012221222002220 |
4 | 12120222000123110222100 |
5 | 12140101232102434113 |
6 | 135420554112141040 |
7 | 5625622160335422 |
oct | 630520033245220 |
9 | 120380205858086 |
10 | 28082650827408 |
11 | 8a47870308201 |
12 | 3196732b37780 |
13 | 128924b26a818 |
14 | 6d12c9748812 |
15 | 33a762d8a523 |
hex | 198a806d4a90 |
28082650827408 has 80 divisors (see below), whose sum is σ = 73521817754880. Its totient is φ = 9235263817728.
The previous prime is 28082650827391. The next prime is 28082650827449. The reversal of 28082650827408 is 80472805628082.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2063266 + ... + 7773182.
It is an arithmetic number, because the mean of its divisors is an integer number (919022721936).
Almost surely, 228082650827408 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 28082650827408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36760908877440).
28082650827408 is an abundant number, since it is smaller than the sum of its proper divisors (45439166927472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28082650827408 is a wasteful number, since it uses less digits than its factorization.
28082650827408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5711304 (or 5711298 counting only the distinct ones).
The product of its (nonzero) digits is 27525120, while the sum is 60.
The spelling of 28082650827408 in words is "twenty-eight trillion, eighty-two billion, six hundred fifty million, eight hundred twenty-seven thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •