Search a number
-
+
151013117051 is a prime number
BaseRepresentation
bin1000110010100100010…
…1010100110001111011
3112102210100211012012022
42030221011110301323
54433233324221201
6153212515105055
713624150213166
oct2145105246173
9472710735168
10151013117051
1159053a70a75
1225325ba218b
131131842cbc4
147448154add
153ddca0241b
hex2329154c7b

151013117051 has 2 divisors, whose sum is σ = 151013117052. Its totient is φ = 151013117050.

The previous prime is 151013117041. The next prime is 151013117071. The reversal of 151013117051 is 150711310151.

It is a weak prime.

It is a cyclic number.

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

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

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

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

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

Almost surely, 2151013117051 is an apocalyptic number.

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

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

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

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

The spelling of 151013117051 in words is "one hundred fifty-one billion, thirteen million, one hundred seventeen thousand, fifty-one".