Search a number
-
+
151025722681 is a prime number
BaseRepresentation
bin1000110010100111010…
…1011010010100111001
3112102211020112121212111
42030221311122110321
54433300041111211
6153214045212321
713624362314251
oct2145165322471
9472736477774
10151025722681
11590600a0849
122532a2610a1
131131ac24762
147449ab6961
153dddb92421
hex2329d5a539

151025722681 has 2 divisors, whose sum is σ = 151025722682. Its totient is φ = 151025722680.

The previous prime is 151025722637. The next prime is 151025722723. The reversal of 151025722681 is 186227520151.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 147161235456 + 3864487225 = 383616^2 + 62165^2 .

It is a cyclic number.

It is not a de Polignac number, because 151025722681 - 219 = 151025198393 is a prime.

It is a super-2 number, since 2×1510257226812 (a number of 23 digits) contains 22 as substring.

It is a weakly prime.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2151025722681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 67200, while the sum is 40.

The spelling of 151025722681 in words is "one hundred fifty-one billion, twenty-five million, seven hundred twenty-two thousand, six hundred eighty-one".