Search a number
-
+
407060981 is a prime number
BaseRepresentation
bin11000010000110…
…100000111110101
31001100221211200122
4120100310013311
51313201422411
6104220421325
713041650465
oct3020640765
91040854618
10407060981
11199858a38
12b43a7845
13664444b2
143c0c1ba5
1525b0a9db
hex184341f5

407060981 has 2 divisors, whose sum is σ = 407060982. Its totient is φ = 407060980.

The previous prime is 407060977. The next prime is 407060987. The reversal of 407060981 is 189060704.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 370216081 + 36844900 = 19241^2 + 6070^2 .

It is a cyclic number.

It is not a de Polignac number, because 407060981 - 22 = 407060977 is a prime.

It is a super-2 number, since 2×4070609812 = 331397284505364722, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is equal to p21692672 and since 407060981 and 21692672 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (407060987) 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, 203530490 + 203530491.

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

Almost surely, 2407060981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12096, while the sum is 35.

The square root of 407060981 is about 20175.7523031980. The cubic root of 407060981 is about 741.1165157898.

The spelling of 407060981 in words is "four hundred seven million, sixty thousand, nine hundred eighty-one".