Search a number
-
+
201056151581 is a prime number
BaseRepresentation
bin1011101100111111100…
…0010110100000011101
3201012221221121202002122
42323033320112200131
511243230333322311
6232210335032325
720345234043065
oct2731770264035
9635857552078
10201056151581
11782a3a5754a
1232b7136b6a5
1315c6208973c
149a344883a5
15536b0480db
hex2ecfe1681d

201056151581 has 2 divisors, whose sum is σ = 201056151582. Its totient is φ = 201056151580.

The previous prime is 201056151539. The next prime is 201056151589. The reversal of 201056151581 is 185151650102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 122966643556 + 78089508025 = 350666^2 + 279445^2 .

It is a cyclic number.

It is not a de Polignac number, because 201056151581 - 210 = 201056150557 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2201056151581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12000, while the sum is 35.

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