Search a number
-
+
5110601 = 19268979
BaseRepresentation
bin10011011111101101001001
3100121122102112
4103133231021
52302014401
6301312105
761303466
oct23375511
910548375
105110601
112980741
121865635
13109c232
1497066d
156ae3bb
hex4dfb49

5110601 has 4 divisors (see below), whose sum is σ = 5379600. Its totient is φ = 4841604.

The previous prime is 5110597. The next prime is 5110603. The reversal of 5110601 is 1060115.

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.

It is a cyclic number.

It is not a de Polignac number, because 5110601 - 22 = 5110597 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (5110603) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134471 + ... + 134508.

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

Almost surely, 25110601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 268998.

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

The square root of 5110601 is about 2260.6638405566. The cubic root of 5110601 is about 172.2492442896.

Adding to 5110601 its reverse (1060115), we get a palindrome (6170716).

The spelling of 5110601 in words is "five million, one hundred ten thousand, six hundred one".

Divisors: 1 19 268979 5110601