Base | Representation |
---|---|
bin | 11000000110100101010111… |
… | …11000001000001001010101 |
3 | 20221200000102212120201020222 |
4 | 30003102223320020021111 |
5 | 23421344143143100010 |
6 | 304421050243004125 |
7 | 14110216204623242 |
oct | 1403225370101125 |
9 | 227600385521228 |
10 | 53002780050005 |
11 | 15985397616555 |
12 | 5b40363969645 |
13 | 23761aa1b6686 |
14 | d134c38105c9 |
15 | 61dacd49c355 |
hex | 3034abe08255 |
53002780050005 has 8 divisors (see below), whose sum is σ = 64166197441752. Its totient is φ = 42026983118848.
The previous prime is 53002780049987. The next prime is 53002780050013. The reversal of 53002780050005 is 50005008720035.
It can be written as a sum of positive squares in 4 ways, for example, as 5011110579601 + 47991669470404 = 2238551^2 + 6927602^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53002780050005 is a prime.
It is a Duffinian number.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 46905114524 + ... + 46905115653.
It is an arithmetic number, because the mean of its divisors is an integer number (8020774680219).
Almost surely, 253002780050005 is an apocalyptic number.
It is an amenable number.
53002780050005 is a deficient number, since it is larger than the sum of its proper divisors (11163417391747).
53002780050005 is a wasteful number, since it uses less digits than its factorization.
53002780050005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93810230295.
The product of its (nonzero) digits is 42000, while the sum is 35.
The spelling of 53002780050005 in words is "fifty-three trillion, two billion, seven hundred eighty million, fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •