5303161 has 4 divisors (see below), whose sum is σ = 5354752. Its totient is φ = 5251572.

The previous prime is 5303149. The next prime is 5303183. The reversal of 5303161 is 1613035.

5303161 is digitally balanced in base 3, 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 a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1613035 = 5 ⋅322607.

It is a cyclic number.

It is not a de Polignac number, because 5303161 - 2¹³ = 5294969 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (5303131) 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, 25641 + ... + 25846.

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

Almost surely, 2^5303161 is an apocalyptic number.

It is an amenable number.

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

5303161 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 51590.

The product of its (nonzero) digits is 270, while the sum is 19.

The square root of 5303161 is about 2302.8593096410. The cubic root of 5303161 is about 174.3859951615.

Adding to 5303161 its reverse (1613035), we get a palindrome (6916196).

The spelling of 5303161 in words is "five million, three hundred three thousand, one hundred sixty-one".