Search a number
-
+
20105677 is a prime number
BaseRepresentation
bin100110010110…
…0100111001101
31101211110210201
41030230213031
520121340202
61554533501
7332616064
oct114544715
941743721
1020105677
1110392769
126897291
13421c567
1429551db
151b72387
hex132c9cd

20105677 has 2 divisors, whose sum is σ = 20105678. Its totient is φ = 20105676.

The previous prime is 20105669. The next prime is 20105681. The reversal of 20105677 is 77650102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12187081 + 7918596 = 3491^2 + 2814^2 .

It is a cyclic number.

It is not a de Polignac number, because 20105677 - 23 = 20105669 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 220105677 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2940, while the sum is 28.

The square root of 20105677 is about 4483.9354366449. The cubic root of 20105677 is about 271.9190079288.

Adding to 20105677 its reverse (77650102), we get a palindrome (97755779).

The spelling of 20105677 in words is "twenty million, one hundred five thousand, six hundred seventy-seven".