Search a number
-
+
151001023 is a prime number
BaseRepresentation
bin10010000000000…
…01011110111111
3101112010122110111
421000001132333
5302124013043
622552250451
73512326135
oct1100013677
9345118414
10151001023
1178266338
12426a0a27
132538c724
14160a9755
15d3cb09d
hex90017bf

151001023 has 2 divisors, whose sum is σ = 151001024. Its totient is φ = 151001022.

The previous prime is 151001017. The next prime is 151001041. The reversal of 151001023 is 320100151.

It is a weak prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 2151001023 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 13.

The square root of 151001023 is about 12288.2473526537. The cubic root of 151001023 is about 532.5086047086.

Adding to 151001023 its reverse (320100151), we get a palindrome (471101174).

The spelling of 151001023 in words is "one hundred fifty-one million, one thousand, twenty-three".