Base | Representation |
---|---|
bin | 110001011000010000… |
… | …001101010110100001 |
3 | 12001212001221211212111 |
4 | 301120100031112201 |
5 | 1332041141022203 |
6 | 40205051555321 |
7 | 3554614462603 |
oct | 613020152641 |
9 | 161761854774 |
10 | 53020251553 |
11 | 20538605815 |
12 | a33845bb41 |
13 | 4ccc6c5019 |
14 | 27cd8c9173 |
15 | 15a4ad926d |
hex | c5840d5a1 |
53020251553 has 4 divisors (see below), whose sum is σ = 53023072960. Its totient is φ = 53017430148.
The previous prime is 53020251523. The next prime is 53020251577. The reversal of 53020251553 is 35515202035.
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, and also an emirpimes, since its reverse is a distinct semiprime: 35515202035 = 5 ⋅7103040407.
It is a cyclic number.
It is not a de Polignac number, because 53020251553 - 29 = 53020251041 is a prime.
It is a super-2 number, since 2×530202515532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53020251503) 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, 1382325 + ... + 1420162.
It is an arithmetic number, because the mean of its divisors is an integer number (13255768240).
Almost surely, 253020251553 is an apocalyptic number.
It is an amenable number.
53020251553 is a deficient number, since it is larger than the sum of its proper divisors (2821407).
53020251553 is a wasteful number, since it uses less digits than its factorization.
53020251553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2821406.
The product of its (nonzero) digits is 22500, while the sum is 31.
Adding to 53020251553 its reverse (35515202035), we get a palindrome (88535453588).
The spelling of 53020251553 in words is "fifty-three billion, twenty million, two hundred fifty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •