Search a number
-
+
151071551 is a prime number
BaseRepresentation
bin10010000000100…
…10101100111111
3101112021020012122
421000102230333
5302133242201
622553553155
73513041561
oct1100225477
9345236178
10151071551
1178304324
12427157bb
13253b5867
14160c7331
15d3e1e1b
hex9012b3f

151071551 has 2 divisors, whose sum is σ = 151071552. Its totient is φ = 151071550.

The previous prime is 151071541. The next prime is 151071581. The reversal of 151071551 is 155170151.

It is a weak prime.

It is an emirp because it is prime and its reverse (155170151) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 151071551 - 214 = 151055167 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 151071551.

It is a congruent number.

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

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

Almost surely, 2151071551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 875, while the sum is 26.

The square root of 151071551 is about 12291.1167515405. The cubic root of 151071551 is about 532.5914980128.

The spelling of 151071551 in words is "one hundred fifty-one million, seventy-one thousand, five hundred fifty-one".