Search a number
-
+
105362351371 is a prime number
BaseRepresentation
bin110001000100000010…
…1011110010100001011
3101001221212212000110001
41202020011132110023
53211240230220441
6120223000503431
710416656131654
oct1421005362413
9331855760401
10105362351371
1140758334052
121850577ab77
139c2175a414
1451572c652b
152b19db9731
hex188815e50b

105362351371 has 2 divisors, whose sum is σ = 105362351372. Its totient is φ = 105362351370.

The previous prime is 105362351317. The next prime is 105362351401. The reversal of 105362351371 is 173153263501.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 105362351371 - 29 = 105362350859 is a prime.

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

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

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

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

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

Almost surely, 2105362351371 is an apocalyptic number.

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

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

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

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

The spelling of 105362351371 in words is "one hundred five billion, three hundred sixty-two million, three hundred fifty-one thousand, three hundred seventy-one".