Search a number
-
+
14505157 = 23630659
BaseRepresentation
bin110111010101…
…010011000101
31000021221100001
4313111103011
512203131112
61234521301
7234202042
oct67252305
930257301
1014505157
118207a37
124a36231
13300b344
141cd81c9
151417c57
hexdd54c5

14505157 has 4 divisors (see below), whose sum is σ = 15135840. Its totient is φ = 13874476.

The previous prime is 14505143. The next prime is 14505167. The reversal of 14505157 is 75150541.

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 a de Polignac number, because none of the positive numbers 2k-14505157 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 214505157 is an apocalyptic number.

It is an amenable number.

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

14505157 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 630682.

The product of its (nonzero) digits is 3500, while the sum is 28.

The square root of 14505157 is about 3808.5636400092. The cubic root of 14505157 is about 243.8788534589.

Adding to 14505157 its reverse (75150541), we get a palindrome (89655698).

The spelling of 14505157 in words is "fourteen million, five hundred five thousand, one hundred fifty-seven".

Divisors: 1 23 630659 14505157