Search a number
-
+
53013101 is a prime number
BaseRepresentation
bin1100101000111…
…0101001101101
310200202100022012
43022032221231
5102032404401
65132131005
71212414101
oct312165155
9120670265
1053013101
1127a19589
1215906a65
13aca19cb
14707d901
1549c28bb
hex328ea6d

53013101 has 2 divisors, whose sum is σ = 53013102. Its totient is φ = 53013100.

The previous prime is 53013083. The next prime is 53013127. The reversal of 53013101 is 10131035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 36602500 + 16410601 = 6050^2 + 4051^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-53013101 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (53013151) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26506550 + 26506551.

It is an arithmetic number, because the mean of its divisors is an integer number (26506551).

Almost surely, 253013101 is an apocalyptic number.

It is an amenable number.

53013101 is a deficient number, since it is larger than the sum of its proper divisors (1).

53013101 is an equidigital number, since it uses as much as digits as its factorization.

53013101 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 45, while the sum is 14.

The square root of 53013101 is about 7281.0096140577. The cubic root of 53013101 is about 375.6595232494.

Adding to 53013101 its reverse (10131035), we get a palindrome (63144136).

It can be divided in two parts, 530 and 13101, that added together give a palindrome (13631).

The spelling of 53013101 in words is "fifty-three million, thirteen thousand, one hundred one".