Search a number
-
+
151455569 is a prime number
BaseRepresentation
bin10010000011100…
…00011101010001
3101112222201222112
421001300131101
5302233034234
623010115105
73516231266
oct1101603521
9345881875
10151455569
11785468a1
124287ba95
13254bb5a5
141618726d
15d46aace
hex9070751

151455569 has 2 divisors, whose sum is σ = 151455570. Its totient is φ = 151455568.

The previous prime is 151455559. The next prime is 151455571. The reversal of 151455569 is 965554151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 135955600 + 15499969 = 11660^2 + 3937^2 .

It is a cyclic number.

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

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

Together with 151455571, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2151455569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 135000, while the sum is 41.

The square root of 151455569 is about 12306.7286067419. The cubic root of 151455569 is about 533.0423917932.

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