Base | Representation |
---|---|
bin | 1100110101000111011101… |
… | …01000010101101010110010 |
3 | 10200220011120210011110100112 |
4 | 12122203232220111222302 |
5 | 12144221414240031200 |
6 | 140001011122221322 |
7 | 5641230040351460 |
oct | 632435650255262 |
9 | 120804523143315 |
10 | 28213348752050 |
11 | 8a98239939460 |
12 | 31b7b294b4842 |
13 | 1298679905bc7 |
14 | 6d77677ab830 |
15 | 33dd62111535 |
hex | 19a8eea15ab2 |
28213348752050 has 96 divisors (see below), whose sum is σ = 65433428671104. Its totient is φ = 8792726400000.
The previous prime is 28213348752007. The next prime is 28213348752053. The reversal of 28213348752050 is 5025784331282.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a self number, because there is not a number n which added to its sum of digits gives 28213348752050.
It is not an unprimeable number, because it can be changed into a prime (28213348752053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32297834 + ... + 33159866.
It is an arithmetic number, because the mean of its divisors is an integer number (681598215324).
Almost surely, 228213348752050 is an apocalyptic number.
28213348752050 is an abundant number, since it is smaller than the sum of its proper divisors (37220079919054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28213348752050 is a wasteful number, since it uses less digits than its factorization.
28213348752050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 870564 (or 870559 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 50.
The spelling of 28213348752050 in words is "twenty-eight trillion, two hundred thirteen billion, three hundred forty-eight million, seven hundred fifty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •