Search a number
-
+
151280951 is a prime number
BaseRepresentation
bin10010000010001…
…01110100110111
3101112122212110012
421001011310313
5302211442301
623002250435
73514603223
oct1101056467
9345585405
10151280951
1178437688
12427b6a1b
1325459c73
141613d783
15d433ebb
hex9045d37

151280951 has 2 divisors, whose sum is σ = 151280952. Its totient is φ = 151280950.

The previous prime is 151280947. The next prime is 151280953. The reversal of 151280951 is 159082151.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 151280951 - 22 = 151280947 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 2151280951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 32.

The square root of 151280951 is about 12299.6321489710. The cubic root of 151280951 is about 532.8374591055.

The spelling of 151280951 in words is "one hundred fifty-one million, two hundred eighty thousand, nine hundred fifty-one".