Search a number
-
+
151016897 is a prime number
BaseRepresentation
bin10010000000001…
…01010111000001
3101112011110020102
421000011113001
5302130020042
622552452145
73512423333
oct1100052701
9345143212
10151016897
1178277259
12426aa055
1325396a15
14160b1453
15d3d0b32
hex90055c1

151016897 has 2 divisors, whose sum is σ = 151016898. Its totient is φ = 151016896.

The previous prime is 151016893. The next prime is 151016927. The reversal of 151016897 is 798610151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103144336 + 47872561 = 10156^2 + 6919^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 151016897 - 22 = 151016893 is a prime.

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

It is equal to p8498270 and since 151016897 and 8498270 have the same sum of digits, it is a Honaker prime.

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

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

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

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

Almost surely, 2151016897 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15120, while the sum is 38.

The square root of 151016897 is about 12288.8932373912. The cubic root of 151016897 is about 532.5272640643.

The spelling of 151016897 in words is "one hundred fifty-one million, sixteen thousand, eight hundred ninety-seven".