Base | Representation |
---|---|
bin | 1100101110111011000000… |
… | …00000011011000001100101 |
3 | 10200010211012011102212200002 |
4 | 12113131200000123001211 |
5 | 12132230012121313203 |
6 | 135315130413031045 |
7 | 5616653361315521 |
oct | 627354000330145 |
9 | 120124164385602 |
10 | 28000502526053 |
11 | 8a15a45782562 |
12 | 3182827785485 |
13 | 1281589035995 |
14 | 6cb33554cd81 |
15 | 338555eb2d88 |
hex | 19776001b065 |
28000502526053 has 8 divisors (see below), whose sum is σ = 28083567206208. Its totient is φ = 27917458994304.
The previous prime is 28000502526049. The next prime is 28000502526067. The reversal of 28000502526053 is 35062520500082.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28000502526053 - 22 = 28000502526049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28000502525998 and 28000502526016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28000502526853) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2633201 + ... + 7933142.
It is an arithmetic number, because the mean of its divisors is an integer number (3510445900776).
Almost surely, 228000502526053 is an apocalyptic number.
It is an amenable number.
28000502526053 is a deficient number, since it is larger than the sum of its proper divisors (83064680155).
28000502526053 is a wasteful number, since it uses less digits than its factorization.
28000502526053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10574203.
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 28000502526053 in words is "twenty-eight trillion, five hundred two million, five hundred twenty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •