Search a number
-
+
105536143513 is a prime number
BaseRepresentation
bin110001001001001110…
…0011100000010011001
3101002101222212120110001
41202102130130002121
53212114223043023
6120252125453001
710424166263413
oct1422234340231
9332358776401
10105536143513
1140837446719
1218553a11161
139c4b7697c8
1451724059b3
152b2a2986ad
hex189271c099

105536143513 has 2 divisors, whose sum is σ = 105536143514. Its totient is φ = 105536143512.

The previous prime is 105536143501. The next prime is 105536143567. The reversal of 105536143513 is 315341635501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 105474253824 + 61889689 = 324768^2 + 7867^2 .

It is a cyclic number.

It is not a de Polignac number, because 105536143513 - 217 = 105536012441 is a prime.

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

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

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

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

Almost surely, 2105536143513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81000, while the sum is 37.

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