Base | Representation |
---|---|
bin | 1100101010010… |
… | …1000110011011 |
3 | 10200221000102202 |
4 | 3022211012123 |
5 | 102043330201 |
6 | 5134120415 |
7 | 1213246136 |
oct | 312450633 |
9 | 120830382 |
10 | 53105051 |
11 | 27a8167a |
12 | 1595010b |
13 | b00480c |
14 | 70a521d |
15 | 49dec6b |
hex | 32a519b |
53105051 has 2 divisors, whose sum is σ = 53105052. Its totient is φ = 53105050.
The previous prime is 53105047. The next prime is 53105053. The reversal of 53105051 is 15050135.
It is a happy number.
53105051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53105051 - 22 = 53105047 is a prime.
It is a Sophie Germain prime.
Together with 53105053, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (53105053) 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 as a sum of consecutive naturals, namely, 26552525 + 26552526.
It is an arithmetic number, because the mean of its divisors is an integer number (26552526).
Almost surely, 253105051 is an apocalyptic number.
53105051 is a deficient number, since it is larger than the sum of its proper divisors (1).
53105051 is an equidigital number, since it uses as much as digits as its factorization.
53105051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 375, while the sum is 20.
The square root of 53105051 is about 7287.3212499519. The cubic root of 53105051 is about 375.8765887233.
Adding to 53105051 its reverse (15050135), we get a palindrome (68155186).
The spelling of 53105051 in words is "fifty-three million, one hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •