Base | Representation |
---|---|
bin | 1100110000100… |
… | …0011101110011 |
3 | 10201200200201211 |
4 | 3030020131303 |
5 | 102144341201 |
6 | 5150540551 |
7 | 1216562545 |
oct | 314103563 |
9 | 121620654 |
10 | 53512051 |
11 | 2822a43a |
12 | 15b07757 |
13 | b117b48 |
14 | 716d695 |
15 | 4a70651 |
hex | 3308773 |
53512051 has 4 divisors (see below), whose sum is σ = 54113400. Its totient is φ = 52910704.
The previous prime is 53512049. The next prime is 53512079. The reversal of 53512051 is 15021535.
53512051 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, and also an emirpimes, since its reverse is a distinct semiprime: 15021535 = 5 ⋅3004307.
It is a cyclic number.
It is not a de Polignac number, because 53512051 - 21 = 53512049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53512001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300541 + ... + 300718.
It is an arithmetic number, because the mean of its divisors is an integer number (13528350).
Almost surely, 253512051 is an apocalyptic number.
53512051 is a deficient number, since it is larger than the sum of its proper divisors (601349).
53512051 is an equidigital number, since it uses as much as digits as its factorization.
53512051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601348.
The product of its (nonzero) digits is 750, while the sum is 22.
The square root of 53512051 is about 7315.1931621797. The cubic root of 53512051 is about 376.8343921972.
Adding to 53512051 its reverse (15021535), we get a palindrome (68533586).
The spelling of 53512051 in words is "fifty-three million, five hundred twelve thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •