Search a number
-
+
105343430513 is a prime number
BaseRepresentation
bin110001000011011110…
…1010010111101110001
3101001220120020201220112
41202012331102331301
53211220404234023
6120221043151105
710416336246056
oct1420675227561
9331816221815
10105343430513
1140748690582
12184bb375495
139c1a864249
14515499d02d
152b183cd478
hex1886f52f71

105343430513 has 2 divisors, whose sum is σ = 105343430514. Its totient is φ = 105343430512.

The previous prime is 105343430497. The next prime is 105343430561. The reversal of 105343430513 is 315034343501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 89008545649 + 16334884864 = 298343^2 + 127808^2 .

It is a cyclic number.

It is not a de Polignac number, because 105343430513 - 24 = 105343430497 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 105343430513.

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

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

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

Almost surely, 2105343430513 is an apocalyptic number.

It is an amenable number.

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

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

105343430513 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 32400, while the sum is 32.

The spelling of 105343430513 in words is "one hundred five billion, three hundred forty-three million, four hundred thirty thousand, five hundred thirteen".