Search a number
-
+
215651025131 is a prime number
BaseRepresentation
bin1100100011010111001…
…1011000000011101011
3202121122002110010202212
43020311303120003223
512013123130301011
6243022501515335
721403014316613
oct3106563300353
9677562403685
10215651025131
1183503422013
1235965112b4b
13174499ba9a9
14a61a971a43
1559224d508b
hex3235cd80eb

215651025131 has 2 divisors, whose sum is σ = 215651025132. Its totient is φ = 215651025130.

The previous prime is 215651025053. The next prime is 215651025179. The reversal of 215651025131 is 131520156512.

215651025131 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 is a cyclic number.

It is not a de Polignac number, because 215651025131 - 214 = 215651008747 is a prime.

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

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

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, 107825512565 + 107825512566.

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

Almost surely, 2215651025131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9000, while the sum is 32.

The spelling of 215651025131 in words is "two hundred fifteen billion, six hundred fifty-one million, twenty-five thousand, one hundred thirty-one".