Search a number
-
+
15303643013 is a prime number
BaseRepresentation
bin11100100000010101…
…10000111110000101
31110111112111121121002
432100022300332011
5222320213034023
611010322103045
71051144551011
oct162012607605
943445447532
1015303643013
11654356455a
122b711aaa85
13159b721089
14a526a5541
155e87e2b28
hex3902b0f85

15303643013 has 2 divisors, whose sum is σ = 15303643014. Its totient is φ = 15303643012.

The previous prime is 15303642941. The next prime is 15303643031. The reversal of 15303643013 is 31034630351.

Together with next prime (15303643031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9239438884 + 6064204129 = 96122^2 + 77873^2 .

It is an emirp because it is prime and its reverse (31034630351) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15303643013 is a prime.

It is a congruent number.

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

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

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

Almost surely, 215303643013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 15303643013 in words is "fifteen billion, three hundred three million, six hundred forty-three thousand, thirteen".