Base | Representation |
---|---|
bin | 1100110110101111110000… |
… | …11100100111100111010000 |
3 | 10201002112010110200100211200 |
4 | 12123113320130213213100 |
5 | 12201131111043324312 |
6 | 140042431553111200 |
7 | 5645251540342323 |
oct | 633277034474720 |
9 | 121075113610750 |
10 | 28269348026832 |
11 | 9009a65a87440 |
12 | 3206957558500 |
13 | 12a0a32549563 |
14 | 6da35ab9c7ba |
15 | 34053d4e90dc |
hex | 19b5f87279d0 |
28269348026832 has 120 divisors (see below), whose sum is σ = 86439349590048. Its totient is φ = 8553350150400.
The previous prime is 28269348026831. The next prime is 28269348026869. The reversal of 28269348026832 is 23862084396282.
28269348026832 is a `hidden beast` number, since 2 + 8 + 2 + 6 + 93 + 480 + 2 + 68 + 3 + 2 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 28269348026832.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28269348026831) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12630894 + ... + 14699597.
Almost surely, 228269348026832 is an apocalyptic number.
28269348026832 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
28269348026832 is an abundant number, since it is smaller than the sum of its proper divisors (58170001563216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28269348026832 is a wasteful number, since it uses less digits than its factorization.
28269348026832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27331169 (or 27331160 counting only the distinct ones).
The product of its (nonzero) digits is 95551488, while the sum is 63.
The spelling of 28269348026832 in words is "twenty-eight trillion, two hundred sixty-nine billion, three hundred forty-eight million, twenty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •