Search a number
-
+
151101989 is a prime number
BaseRepresentation
bin10010000000110…
…10001000100101
3101112022202221222
421000122020211
5302140230424
622554350125
73513226403
oct1100321045
9345282858
10151101989
1178325185
124272b345
13253c667c
14160d4473
15d3eae5e
hex901a225

151101989 has 2 divisors, whose sum is σ = 151101990. Its totient is φ = 151101988.

The previous prime is 151101971. The next prime is 151102027. The reversal of 151101989 is 989101151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 148596100 + 2505889 = 12190^2 + 1583^2 .

It is a cyclic number.

It is not a de Polignac number, because 151101989 - 28 = 151101733 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2151101989 is an apocalyptic number.

It is an amenable number.

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

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

151101989 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 35.

The square root of 151101989 is about 12292.3549005062. The cubic root of 151101989 is about 532.6272645779.

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