Base | Representation |
---|---|
bin | 110001010111000011… |
… | …000000101011001111 |
3 | 12001210122212200220121 |
4 | 301113003000223033 |
5 | 1332021000431133 |
6 | 40203050125411 |
7 | 3554250455560 |
oct | 612703005317 |
9 | 161718780817 |
10 | 53000014543 |
11 | 20528143413 |
12 | a331720867 |
13 | 4cc845aa68 |
14 | 27cad3c167 |
15 | 15a2e3d02d |
hex | c570c0acf |
53000014543 has 4 divisors (see below), whose sum is σ = 60571445200. Its totient is φ = 45428583888.
The previous prime is 53000014513. The next prime is 53000014553. The reversal of 53000014543 is 34541000035.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34541000035 = 5 ⋅6908200007.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53000014543 is a prime.
It is a super-2 number, since 2×530000145432 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53000014513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3785715318 + ... + 3785715331.
It is an arithmetic number, because the mean of its divisors is an integer number (15142861300).
Almost surely, 253000014543 is an apocalyptic number.
53000014543 is a deficient number, since it is larger than the sum of its proper divisors (7571430657).
53000014543 is an equidigital number, since it uses as much as digits as its factorization.
53000014543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7571430656.
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 53000014543 its reverse (34541000035), we get a palindrome (87541014578).
The spelling of 53000014543 in words is "fifty-three billion, fourteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •