[go: up one dir, main page]

Search a number
-
+
40150151 is a prime number
BaseRepresentation
bin1001100100101…
…0010010000111
32210112211122122
42121022102013
540234301101
63552320155
7665161556
oct231122207
983484578
1040150151
1120733448
121154305b
138419cb2
145491d9d
1537d151b
hex264a487

40150151 has 2 divisors, whose sum is σ = 40150152. Its totient is φ = 40150150.

The previous prime is 40150147. The next prime is 40150153. The reversal of 40150151 is 15105104.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 40150151 - 22 = 40150147 is a prime.

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

It is a Sophie Germain prime.

Together with 40150153, 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 (40150153) 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, 20075075 + 20075076.

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

Almost surely, 240150151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 100, while the sum is 17.

The square root of 40150151 is about 6336.4146802431. The cubic root of 40150151 is about 342.4225793359.

Adding to 40150151 its reverse (15105104), we get a palindrome (55255255).

The spelling of 40150151 in words is "forty million, one hundred fifty thousand, one hundred fifty-one".