Search a number
-
+
5091971 = 31716063
BaseRepresentation
bin10011011011001010000011
3100120200212112
4103123022003
52300420341
6301045535
761165253
oct23331203
910520775
105091971
112968745
1218568ab
131093901
14967963
156a8aeb
hex4db283

5091971 has 4 divisors (see below), whose sum is σ = 5108352. Its totient is φ = 5075592.

The previous prime is 5091953. The next prime is 5091973. The reversal of 5091971 is 1791905.

5091971 is nontrivially palindromic in base 13.

5091971 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.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5091971 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5091973) 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 in 3 ways as a sum of consecutive naturals, for example, 7715 + ... + 8348.

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

Almost surely, 25091971 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16380.

The product of its (nonzero) digits is 2835, while the sum is 32.

The square root of 5091971 is about 2256.5396074521. The cubic root of 5091971 is about 172.0396857227.

The spelling of 5091971 in words is "five million, ninety-one thousand, nine hundred seventy-one".

Divisors: 1 317 16063 5091971