Search a number
-
+
53051 is a prime number
BaseRepresentation
bin1100111100111011
32200202212
430330323
53144201
61045335
7310445
oct147473
980685
1053051
1136949
122684b
131b1bb
1415495
1510abb
hexcf3b

53051 has 2 divisors, whose sum is σ = 53052. Its totient is φ = 53050.

The previous prime is 53047. The next prime is 53069. The reversal of 53051 is 15035.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 53051 - 22 = 53047 is a prime.

It is a Sophie Germain prime.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

253051 is an apocalyptic number.

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

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

53051 is an odious number, because the sum of its binary digits is odd.

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

The square root of 53051 is about 230.3280269529. The cubic root of 53051 is about 37.5749021434.

Adding to 53051 its reverse (15035), we get a palindrome (68086).

The spelling of 53051 in words is "fifty-three thousand, fifty-one".