Search a number
-
+
5109701 = 18712731
BaseRepresentation
bin10011011111011111000101
3100121121012012
4103133133011
52302002301
6301304005
761301042
oct23373705
910547165
105109701
11297aaa3
121865005
13109b9bc
149701c9
156adebb
hex4df7c5

5109701 has 4 divisors (see below), whose sum is σ = 5114304. Its totient is φ = 5105100.

The previous prime is 5109697. The next prime is 5109719. The reversal of 5109701 is 1079015.

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 a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 5109701 - 22 = 5109697 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 25109701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4602.

The product of its (nonzero) digits is 315, while the sum is 23.

The square root of 5109701 is about 2260.4647752177. The cubic root of 5109701 is about 172.2391324052.

The spelling of 5109701 in words is "five million, one hundred nine thousand, seven hundred one".

Divisors: 1 1871 2731 5109701