Base | Representation |
---|---|
bin | 1111110100000010000… |
… | …01010111110111010101 |
3 | 1220221102122012011220211 |
4 | 13322001001113313111 |
5 | 32400220102000203 |
6 | 1053334054125421 |
7 | 54153144023005 |
oct | 7720101276725 |
9 | 1827378164824 |
10 | 543330500053 |
11 | 19a4749a2520 |
12 | 89374350871 |
13 | 3c30b201113 |
14 | 1c423c6a005 |
15 | e1eebe4c6d |
hex | 7e81057dd5 |
543330500053 has 4 divisors (see below), whose sum is σ = 592724181888. Its totient is φ = 493936818220.
The previous prime is 543330500029. The next prime is 543330500081. The reversal of 543330500053 is 350005033345.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 543330500053 - 25 = 543330500021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 543330499988 and 543330500024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (543330500653) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24696840901 + ... + 24696840922.
It is an arithmetic number, because the mean of its divisors is an integer number (148181045472).
Almost surely, 2543330500053 is an apocalyptic number.
It is an amenable number.
543330500053 is a deficient number, since it is larger than the sum of its proper divisors (49393681835).
543330500053 is a wasteful number, since it uses less digits than its factorization.
543330500053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49393681834.
The product of its (nonzero) digits is 40500, while the sum is 31.
Adding to 543330500053 its reverse (350005033345), we get a palindrome (893335533398).
The spelling of 543330500053 in words is "five hundred forty-three billion, three hundred thirty million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •