Search a number
-
+
151000505221 is a prime number
BaseRepresentation
bin1000110010100001010…
…1001101101110000101
3112102202111002110000111
42030220111031232011
54433222112131341
6153211344513021
713623635055046
oct2145025155605
9472674073014
10151000505221
1159047937575
122532191b771
1311315935597
1474465d08cd
153ddb860681
hex232854db85

151000505221 has 2 divisors, whose sum is σ = 151000505222. Its totient is φ = 151000505220.

The previous prime is 151000505213. The next prime is 151000505231. The reversal of 151000505221 is 122505000151.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 105306740100 + 45693765121 = 324510^2 + 213761^2 .

It is a cyclic number.

It is not a de Polignac number, because 151000505221 - 23 = 151000505213 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 151000505192 and 151000505201.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (151000505231) 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, 75500252610 + 75500252611.

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

Almost surely, 2151000505221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 500, while the sum is 22.

Adding to 151000505221 its reverse (122505000151), we get a palindrome (273505505372).

The spelling of 151000505221 in words is "one hundred fifty-one billion, five hundred five thousand, two hundred twenty-one".