Search a number
-
+
156909469 is a prime number
BaseRepresentation
bin10010101101000…
…11111110011101
3101221020211022211
421112203332131
5310132100334
623323040421
73613465003
oct1126437635
9357224284
10156909469
1180631452
1244670111
132667ab52
1416ba6a73
15db96a64
hex95a3f9d

156909469 has 2 divisors, whose sum is σ = 156909470. Its totient is φ = 156909468.

The previous prime is 156909463. The next prime is 156909491. The reversal of 156909469 is 964909651.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 124590244 + 32319225 = 11162^2 + 5685^2 .

It is a cyclic number.

It is not a de Polignac number, because 156909469 - 23 = 156909461 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (156909461) 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 as a sum of consecutive naturals, namely, 78454734 + 78454735.

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

Almost surely, 2156909469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 524880, while the sum is 49.

The square root of 156909469 is about 12526.3509850235. The cubic root of 156909469 is about 539.3653598208.

The spelling of 156909469 in words is "one hundred fifty-six million, nine hundred nine thousand, four hundred sixty-nine".