Base | Representation |
---|---|
bin | 110001011000110110… |
… | …101011001010110001 |
3 | 12001212202221010222011 |
4 | 301120312223022301 |
5 | 1332101231211103 |
6 | 40210052042521 |
7 | 3555066261055 |
oct | 613066531261 |
9 | 161782833864 |
10 | 53030335153 |
11 | 20543272774 |
12 | a33b903441 |
13 | 5001815953 |
14 | 27d0d91c65 |
15 | 15a592bd6d |
hex | c58dab2b1 |
53030335153 has 4 divisors (see below), whose sum is σ = 53057546100. Its totient is φ = 53003124208.
The previous prime is 53030335151. The next prime is 53030335157. The reversal of 53030335153 is 35153303035.
53030335153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 47756235024 + 5274100129 = 218532^2 + 72623^2 .
It is a cyclic number.
It is not a de Polignac number, because 53030335153 - 21 = 53030335151 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53030335151) 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, 13602550 + ... + 13606447.
It is an arithmetic number, because the mean of its divisors is an integer number (13264386525).
Almost surely, 253030335153 is an apocalyptic number.
It is an amenable number.
53030335153 is a deficient number, since it is larger than the sum of its proper divisors (27210947).
53030335153 is a wasteful number, since it uses less digits than its factorization.
53030335153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27210946.
The product of its (nonzero) digits is 30375, while the sum is 31.
Adding to 53030335153 its reverse (35153303035), we get a palindrome (88183638188).
The spelling of 53030335153 in words is "fifty-three billion, thirty million, three hundred thirty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •