Search a number
-
+
151010020201 is a prime number
BaseRepresentation
bin1000110010100011100…
…1100000101101101001
3112102210010222212010011
42030220321200231221
54433232031121301
6153212324451521
713624111664365
oct2145071405551
9472703885104
10151010020201
1159052246297
1225324b49ba1
13113178b7451
14744798a2a5
153ddc5dea51
hex2328e60b69

151010020201 has 2 divisors, whose sum is σ = 151010020202. Its totient is φ = 151010020200.

The previous prime is 151010020169. The next prime is 151010020207. The reversal of 151010020201 is 102020010151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 128164000000 + 22846020201 = 358000^2 + 151149^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 151010020201 - 25 = 151010020169 is a prime.

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

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

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

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

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

Almost surely, 2151010020201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20, while the sum is 13.

Adding to 151010020201 its reverse (102020010151), we get a palindrome (253030030352).

The spelling of 151010020201 in words is "one hundred fifty-one billion, ten million, twenty thousand, two hundred one".