Search a number
-
+
15150190213 is a prime number
BaseRepresentation
bin11100001110000010…
…11000111010000101
31110002211202101221001
432013001120322011
5222011422041323
610543201053301
71044302330524
oct160701307205
943084671831
1015150190213
116474984164
122b29927231
1315759b36c2
14a3a15c4bb
155da0d03ad
hex387058e85

15150190213 has 2 divisors, whose sum is σ = 15150190214. Its totient is φ = 15150190212.

The previous prime is 15150190199. The next prime is 15150190219. The reversal of 15150190213 is 31209105151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14700835009 + 449355204 = 121247^2 + 21198^2 .

It is a cyclic number.

It is not a de Polignac number, because 15150190213 - 221 = 15148093061 is a prime.

It is a congruent number.

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

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

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

Almost surely, 215150190213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 28.

Adding to 15150190213 its reverse (31209105151), we get a palindrome (46359295364).

The spelling of 15150190213 in words is "fifteen billion, one hundred fifty million, one hundred ninety thousand, two hundred thirteen".