Search a number
-
+
15112622009 is a prime number
BaseRepresentation
bin11100001001100100…
…00100111110111001
31110000020001202001002
432010302010332321
5221422312401014
610535335534345
71043335111322
oct160462047671
943006052032
1015112622009
116455754661
122b1922a3b5
13156ac8b9b4
14a3517d449
155d6b5ddde
hex384c84fb9

15112622009 has 2 divisors, whose sum is σ = 15112622010. Its totient is φ = 15112622008.

The previous prime is 15112621999. The next prime is 15112622051. The reversal of 15112622009 is 90022621151.

15112622009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 13836346384 + 1276275625 = 117628^2 + 35725^2 .

It is a cyclic number.

It is not a de Polignac number, because 15112622009 - 212 = 15112617913 is a prime.

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

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

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

Almost surely, 215112622009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2160, while the sum is 29.

The spelling of 15112622009 in words is "fifteen billion, one hundred twelve million, six hundred twenty-two thousand, nine".