Search a number
-
+
15120101221 is a prime number
BaseRepresentation
bin11100001010011101…
…00110111101100101
31110000202010201120221
432011032212331211
5221431221214341
610540204124341
71043455511521
oct160516467545
943022121527
1015120101221
1164599a2925
122b1b8366b1
13156c6aa074
14a36168d81
155d7639ed1
hex3853a6f65

15120101221 has 2 divisors, whose sum is σ = 15120101222. Its totient is φ = 15120101220.

The previous prime is 15120101209. The next prime is 15120101233. The reversal of 15120101221 is 12210102151.

It is a balanced prime because it is at equal distance from previous prime (15120101209) and next prime (15120101233).

It can be written as a sum of positive squares in only one way, i.e., 14513020900 + 607080321 = 120470^2 + 24639^2 .

It is a cyclic number.

It is not a de Polignac number, because 15120101221 - 27 = 15120101093 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215120101221 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 15120101221 its reverse (12210102151), we get a palindrome (27330203372).

The spelling of 15120101221 in words is "fifteen billion, one hundred twenty million, one hundred one thousand, two hundred twenty-one".