Search a number
-
+
14091969151 = 131083997627
BaseRepresentation
bin11010001111111001…
…00110001001111111
31100101002112012112101
431013330212021333
5212330021003101
610250155445531
71006132522111
oct150774461177
940332465471
1014091969151
115a81604aa7
1228934568a7
1314376a01b0
149797b73b1
1557724d401
hex347f2627f

14091969151 has 4 divisors (see below), whose sum is σ = 15175966792. Its totient is φ = 13007971512.

The previous prime is 14091969139. The next prime is 14091969161. The reversal of 14091969151 is 15196919041.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 14091969151 - 213 = 14091960959 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 (14091969131) 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, 541998801 + ... + 541998826.

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

Almost surely, 214091969151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1083997640.

The product of its (nonzero) digits is 87480, while the sum is 46.

The spelling of 14091969151 in words is "fourteen billion, ninety-one million, nine hundred sixty-nine thousand, one hundred fifty-one".

Divisors: 1 13 1083997627 14091969151