Search a number
-
+
109993931240861 is a prime number
BaseRepresentation
bin11001000000100111110101…
…001100101111010110011101
3112102110022120012002212122002
4121000213311030233112131
5103404120032344201421
61025534303041132045
732111541104103323
oct3100476514572635
9472408505085562
10109993931240861
1132058189716678
121040568902a025
13494b4c9bac915
141d23a3dd53d13
15cab2dba46b0b
hex6409f532f59d

109993931240861 has 2 divisors, whose sum is σ = 109993931240862. Its totient is φ = 109993931240860.

The previous prime is 109993931240821. The next prime is 109993931240899. The reversal of 109993931240861 is 168042139399901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 89922187218361 + 20071744022500 = 9482731^2 + 4480150^2 .

It is a cyclic number.

It is not a de Polignac number, because 109993931240861 - 214 = 109993931224477 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2109993931240861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22674816, while the sum is 65.

The spelling of 109993931240861 in words is "one hundred nine trillion, nine hundred ninety-three billion, nine hundred thirty-one million, two hundred forty thousand, eight hundred sixty-one".