Base | Representation |
---|---|
bin | 1100110110101001100110… |
… | …00010111000101000100000 |
3 | 10201002012120122211120022200 |
4 | 12123110303002320220200 |
5 | 12201102320224403443 |
6 | 140041123204333200 |
7 | 5645103504123003 |
oct | 633246302705040 |
9 | 121065518746280 |
10 | 28266036169248 |
11 | 9008616583859 |
12 | 32061923a4200 |
13 | 12a0625375007 |
14 | 6da124db753a |
15 | 3403e78a2dd3 |
hex | 19b5330b8a20 |
28266036169248 has 72 divisors (see below), whose sum is σ = 80387006829948. Its totient is φ = 9421371297792.
The previous prime is 28266036169229. The next prime is 28266036169367. The reversal of 28266036169248 is 84296163066282.
It is a happy number.
28266036169248 is a `hidden beast` number, since 2 + 8 + 2 + 6 + 6 + 0 + 3 + 616 + 9 + 2 + 4 + 8 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 28247226595344 + 18809573904 = 5314812^2 + 137148^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 914340 + ... + 7574172.
Almost surely, 228266036169248 is an apocalyptic number.
It is an amenable number.
28266036169248 is an abundant number, since it is smaller than the sum of its proper divisors (52120970660700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28266036169248 is a wasteful number, since it uses less digits than its factorization.
28266036169248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6674586 (or 6674575 counting only the distinct ones).
The product of its (nonzero) digits is 71663616, while the sum is 63.
The spelling of 28266036169248 in words is "twenty-eight trillion, two hundred sixty-six billion, thirty-six million, one hundred sixty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •