Search a number
-
+
6110105611613 is a prime number
BaseRepresentation
bin101100011101001111010…
…1011001010110101011101
3210122010020202200011011112
41120322132223022311131
51300101444014032423
620554535504231405
71200304053525203
oct130723653126535
923563222604145
106110105611613
111a46310367093
1282821a00b565
133542466b6783
14171a33025073
15a8e10492a78
hex58e9eacad5d

6110105611613 has 2 divisors, whose sum is σ = 6110105611614. Its totient is φ = 6110105611612.

The previous prime is 6110105611609. The next prime is 6110105611633. The reversal of 6110105611613 is 3161165010116.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4953304262404 + 1156801349209 = 2225602^2 + 1075547^2 .

It is a cyclic number.

It is not a de Polignac number, because 6110105611613 - 22 = 6110105611609 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 26110105611613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 32.

The spelling of 6110105611613 in words is "six trillion, one hundred ten billion, one hundred five million, six hundred eleven thousand, six hundred thirteen".