Search a number
-
+
106647374345791 is a prime number
BaseRepresentation
bin11000001111111011000110…
…110111010011011000111111
3111222121101111212220020211211
4120033323012313103120333
5102434302310313031131
61014453043304425251
731315006232614606
oct3017730667233077
9458541455806754
10106647374345791
1130a87996588314
12bb64b85a78227
134767a5bc1a0c6
141c49a909b6a3d
15c4e2226bd5b1
hex60fec6dd363f

106647374345791 has 2 divisors, whose sum is σ = 106647374345792. Its totient is φ = 106647374345790.

The previous prime is 106647374345773. The next prime is 106647374345807. The reversal of 106647374345791 is 197543473746601.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 106647374345791 - 213 = 106647374337599 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2106647374345791 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 320060160, while the sum is 67.

The spelling of 106647374345791 in words is "one hundred six trillion, six hundred forty-seven billion, three hundred seventy-four million, three hundred forty-five thousand, seven hundred ninety-one".