Base | Representation |
---|---|
bin | 110001110100110111… |
… | …000101010111100001 |
3 | 12010002112001222120001 |
4 | 301310313011113201 |
5 | 1334032023021023 |
6 | 40324435020001 |
7 | 3602533143430 |
oct | 616467052741 |
9 | 163075058501 |
10 | 53500204513 |
11 | 2076451a558 |
12 | a45113a601 |
13 | 5077c7b462 |
14 | 2837543117 |
15 | 15d1ce26ad |
hex | c74dc55e1 |
53500204513 has 32 divisors (see below), whose sum is σ = 63607928832. Its totient is φ = 44051904000.
The previous prime is 53500204489. The next prime is 53500204543. The reversal of 53500204513 is 31540200535.
It is a de Polignac number, because none of the positive numbers 2k-53500204513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (53500204543) 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 31 ways as a sum of consecutive naturals, for example, 5041413 + ... + 5052013.
It is an arithmetic number, because the mean of its divisors is an integer number (1987747776).
Almost surely, 253500204513 is an apocalyptic number.
53500204513 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
53500204513 is a deficient number, since it is larger than the sum of its proper divisors (10107724319).
53500204513 is a wasteful number, since it uses less digits than its factorization.
53500204513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10945.
The product of its (nonzero) digits is 9000, while the sum is 28.
The spelling of 53500204513 in words is "fifty-three billion, five hundred million, two hundred four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •