Search a number
-
+
15105096913 is a prime number
BaseRepresentation
bin11100001000101010…
…10111110011010001
31102222200220102112211
432010111113303101
5221413401100123
610534510352121
71043214130264
oct160425276321
942880812484
1015105096913
116451484975
122b167bb641
13156955578a
14a34180cdb
155d617440d
hex384557cd1

15105096913 has 2 divisors, whose sum is σ = 15105096914. Its totient is φ = 15105096912.

The previous prime is 15105096893. The next prime is 15105096967. The reversal of 15105096913 is 31969050151.

15105096913 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., 14997186369 + 107910544 = 122463^2 + 10388^2 .

It is a cyclic number.

It is not a de Polignac number, because 15105096913 - 221 = 15102999761 is a prime.

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

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

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

Almost surely, 215105096913 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 15105096913 in words is "fifteen billion, one hundred five million, ninety-six thousand, nine hundred thirteen".