Search a number
-
+
150601981 is a prime number
BaseRepresentation
bin10001111101000…
…00000011111101
3101111101101002011
420332200003331
5302023230411
622535531221
73506044555
oct1076400375
9344341064
10150601981
1178013552
1242529b11
132527cbca
1416004165
15d34cc21
hex8fa00fd

150601981 has 2 divisors, whose sum is σ = 150601982. Its totient is φ = 150601980.

The previous prime is 150601967. The next prime is 150602003. The reversal of 150601981 is 189106051.

150601981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 149670756 + 931225 = 12234^2 + 965^2 .

It is a cyclic number.

It is not a de Polignac number, because 150601981 - 29 = 150601469 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (150601931) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75300990 + 75300991.

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

Almost surely, 2150601981 is an apocalyptic number.

It is an amenable number.

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

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

150601981 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2160, while the sum is 31.

The square root of 150601981 is about 12271.9998777705. Note that the first 3 decimals coincide. The cubic root of 150601981 is about 532.0391139482.

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