Search a number
-
+
105630605737 is a prime number
BaseRepresentation
bin110001001100000010…
…0110010000110101001
3101002122120121202020221
41202120010302012221
53212312413340422
6120305342250041
710426424222446
oct1423004620651
9332576552227
10105630605737
11408857a5578
121857b586921
139c651c1807
145180b949cd
152b337073c7
hex18981321a9

105630605737 has 2 divisors, whose sum is σ = 105630605738. Its totient is φ = 105630605736.

The previous prime is 105630605723. The next prime is 105630605813. The reversal of 105630605737 is 737506036501.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 81661063696 + 23969542041 = 285764^2 + 154821^2 .

It is a cyclic number.

It is not a de Polignac number, because 105630605737 - 27 = 105630605609 is a prime.

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

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

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

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

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

Almost surely, 2105630605737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 396900, while the sum is 43.

The spelling of 105630605737 in words is "one hundred five billion, six hundred thirty million, six hundred five thousand, seven hundred thirty-seven".