Search a number
-
+
105108904075793 is a prime number
BaseRepresentation
bin10111111001100010010010…
…111000111110001000010001
3111210011022110020122220200112
4113321202102320332020101
5102234101013420411133
61011314210335331105
731065603425235512
oct2771422270761021
9453138406586615
10105108904075793
1130544488192762
12b956987380a95
13468595b652637
141bd5425dc0a09
15c241cccaa648
hex5f9892e3e211

105108904075793 has 2 divisors, whose sum is σ = 105108904075794. Its totient is φ = 105108904075792.

The previous prime is 105108904075781. The next prime is 105108904075817. The reversal of 105108904075793 is 397570409801501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 88883733385489 + 16225170690304 = 9427817^2 + 4028048^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-105108904075793 is a prime.

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

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

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

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

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

Almost surely, 2105108904075793 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9525600, while the sum is 59.

The spelling of 105108904075793 in words is "one hundred five trillion, one hundred eight billion, nine hundred four million, seventy-five thousand, seven hundred ninety-three".