Search a number
-
+
5110161 = 37234763
BaseRepresentation
bin10011011111100110010001
3100121121211020
4103133212101
52302011121
6301310053
761302300
oct23374621
910547736
105110161
112980381
121865329
13109bc84
14970437
156ae1c6
hex4df991

5110161 has 12 divisors (see below), whose sum is σ = 7926192. Its totient is φ = 2920008.

The previous prime is 5110159. The next prime is 5110211. The reversal of 5110161 is 1610115.

It is not a de Polignac number, because 5110161 - 21 = 5110159 is a prime.

It is a super-2 number, since 2×51101612 = 52227490891842, which contains 22 as substring.

It is a Curzon number.

5110161 is a lucky number.

It is a self number, because there is not a number n which added to its sum of digits gives 5110161.

It is not an unprimeable number, because it can be changed into a prime (5110141) 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 11 ways as a sum of consecutive naturals, for example, 17235 + ... + 17528.

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

Almost surely, 25110161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 34780 (or 34773 counting only the distinct ones).

The product of its (nonzero) digits is 30, while the sum is 15.

The square root of 5110161 is about 2260.5665219144. The cubic root of 5110161 is about 172.2443008500.

Adding to 5110161 its reverse (1610115), we get a palindrome (6720276).

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

Divisors: 1 3 7 21 49 147 34763 104289 243341 730023 1703387 5110161