Search a number
-
+
106914728477 is a prime number
BaseRepresentation
bin110001110010010011…
…1010100101000011101
3101012222001220221111102
41203210213110220131
53222430132302402
6121041013402445
710503306124514
oct1434447245035
9335861827442
10106914728477
1141384638a37
1218879639425
13a10b25aa5b
14526354167b
152bab30d102
hex18e49d4a1d

106914728477 has 2 divisors, whose sum is σ = 106914728478. Its totient is φ = 106914728476.

The previous prime is 106914728461. The next prime is 106914728483. The reversal of 106914728477 is 774827419601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105296356036 + 1618372441 = 324494^2 + 40229^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 106914728477 - 24 = 106914728461 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2106914728477 is an apocalyptic number.

It is an amenable number.

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

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

106914728477 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 4741632, while the sum is 56.

The spelling of 106914728477 in words is "one hundred six billion, nine hundred fourteen million, seven hundred twenty-eight thousand, four hundred seventy-seven".