Search a number
-
+
14269151 = 131097627
BaseRepresentation
bin110110011011…
…101011011111
3222211221121002
4312123223133
512123103101
61225500515
7232200011
oct66335337
928757532
1014269151
118066696
12494173b
132c57ab0
141c761b1
1513bcd6b
hexd9badf

14269151 has 4 divisors (see below), whose sum is σ = 15366792. Its totient is φ = 13171512.

The previous prime is 14269141. The next prime is 14269159. The reversal of 14269151 is 15196241.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15196241 = 19378737.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14269151 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 (14269159) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 214269151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1097640.

The product of its digits is 2160, while the sum is 29.

The square root of 14269151 is about 3777.4529778675. The cubic root of 14269151 is about 242.5489382934.

The spelling of 14269151 in words is "fourteen million, two hundred sixty-nine thousand, one hundred fifty-one".

Divisors: 1 13 1097627 14269151