Search a number
-
+
151299041 is a prime number
BaseRepresentation
bin10010000010010…
…10001111100001
3101112200210021012
421001022033201
5302213032131
623002510305
73515010035
oct1101121741
9345623235
10151299041
117844a233
1242805395
132546527a
14161461c5
15d43952b
hex904a3e1

151299041 has 2 divisors, whose sum is σ = 151299042. Its totient is φ = 151299040.

The previous prime is 151299023. The next prime is 151299073. The reversal of 151299041 is 140992151.

It is an a-pointer prime, because the next prime (151299073) can be obtained adding 151299041 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 124992400 + 26306641 = 11180^2 + 5129^2 .

It is a cyclic number.

It is not a de Polignac number, because 151299041 - 226 = 84190177 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 151298989 and 151299007.

It is not a weakly prime, because it can be changed into another prime (151299011) 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, 75649520 + 75649521.

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

Almost surely, 2151299041 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 151299041 is about 12300.3675148347. The cubic root of 151299041 is about 532.8586969533.

The spelling of 151299041 in words is "one hundred fifty-one million, two hundred ninety-nine thousand, forty-one".