Base | Representation |
---|---|
bin | 110001011010011010… |
… | …111001100110001101 |
3 | 12001221121100222102202 |
4 | 301122122321212031 |
5 | 1332124442434103 |
6 | 40212431131245 |
7 | 3555535506146 |
oct | 613232714615 |
9 | 161847328382 |
10 | 53056608653 |
11 | 20557088404 |
12 | a348673b25 |
13 | 50070b46b9 |
14 | 27d4670acd |
15 | 15a7dbb988 |
hex | c5a6b998d |
53056608653 has 4 divisors (see below), whose sum is σ = 55849061760. Its totient is φ = 50264155548.
The previous prime is 53056608629. The next prime is 53056608701. The reversal of 53056608653 is 35680665035.
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 53056608653 - 26 = 53056608589 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 53056608598 and 53056608607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53056605653) 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 3 ways as a sum of consecutive naturals, for example, 1396226525 + ... + 1396226562.
It is an arithmetic number, because the mean of its divisors is an integer number (13962265440).
Almost surely, 253056608653 is an apocalyptic number.
It is an amenable number.
53056608653 is a deficient number, since it is larger than the sum of its proper divisors (2792453107).
53056608653 is a wasteful number, since it uses less digits than its factorization.
53056608653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2792453106.
The product of its (nonzero) digits is 1944000, while the sum is 47.
The spelling of 53056608653 in words is "fifty-three billion, fifty-six million, six hundred eight thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •