Search a number
-
+
107085126847 is a prime number
BaseRepresentation
bin110001110111011000…
…1010101110010111111
3101020101221120002010011
41203232301111302333
53223302243024342
6121105541524051
710510445362666
oct1435661256277
9336357502104
10107085126847
1141461842836
1218906713627
13a13764c4aa
14527c019ddd
152bbb26b717
hex18eec55cbf

107085126847 has 2 divisors, whose sum is σ = 107085126848. Its totient is φ = 107085126846.

The previous prime is 107085126809. The next prime is 107085126859. The reversal of 107085126847 is 748621580701.

It is a strong prime.

It is an emirp because it is prime and its reverse (748621580701) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 107085126847 - 223 = 107076738239 is a prime.

It is a super-2 number, since 2×1070851268472 (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 107085126847.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (107085127847) 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, 53542563423 + 53542563424.

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

Almost surely, 2107085126847 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 752640, while the sum is 49.

The spelling of 107085126847 in words is "one hundred seven billion, eighty-five million, one hundred twenty-six thousand, eight hundred forty-seven".