Search a number
-
+
103536635341 is a prime number
BaseRepresentation
bin110000001101101000…
…0111010110111001101
3100220020122110000212211
41200123100322313031
53144020334312331
6115321501230421
710323506610466
oct1403320726715
9326218400784
10103536635341
113aa00805627
1218096262411
1399c0435289
145022a37d6d
152a5e9818b1
hex181b43adcd

103536635341 has 2 divisors, whose sum is σ = 103536635342. Its totient is φ = 103536635340.

The previous prime is 103536635249. The next prime is 103536635357. The reversal of 103536635341 is 143536635301.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88459251241 + 15077384100 = 297421^2 + 122790^2 .

It is a cyclic number.

It is not a de Polignac number, because 103536635341 - 225 = 103503080909 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 103536635294 and 103536635303.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2103536635341 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Subtracting from 103536635341 its sum of digits (40), we obtain a palindrome (103536635301).

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