Search a number
-
+
10977061 is a prime number
BaseRepresentation
bin101001110111…
…111100100101
3202122200200211
4221313330211
510302231221
61031135421
7162206044
oct51677445
922580624
1010977061
116218257
123814571
132374504
14165a55b
15e6c6e1
hexa77f25

10977061 has 2 divisors, whose sum is σ = 10977062. Its totient is φ = 10977060.

The previous prime is 10977059. The next prime is 10977067. The reversal of 10977061 is 16077901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9572836 + 1404225 = 3094^2 + 1185^2 .

It is a cyclic number.

It is not a de Polignac number, because 10977061 - 21 = 10977059 is a prime.

Together with 10977059, it forms a pair of twin primes.

It is a congruent number.

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

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

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

Almost surely, 210977061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2646, while the sum is 31.

The square root of 10977061 is about 3313.1648012135. The cubic root of 10977061 is about 222.2433078974.

It can be divided in two parts, 109770 and 61, that multiplied together give a triangular number (6695970 = T3659).

The spelling of 10977061 in words is "ten million, nine hundred seventy-seven thousand, sixty-one".