Search a number
-
+
940610701 is a prime number
BaseRepresentation
bin111000000100001…
…001010010001101
32102112220222022101
4320010021102031
53411244020301
6233200315101
732211026152
oct7004112215
92375828271
10940610701
11442a4a818
12223012a91
1311cb451a4
148cccc229
155789e701
hex3810948d

940610701 has 2 divisors, whose sum is σ = 940610702. Its totient is φ = 940610700.

The previous prime is 940610683. The next prime is 940610717. The reversal of 940610701 is 107016049.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 727596676 + 213014025 = 26974^2 + 14595^2 .

It is a cyclic number.

It is not a de Polignac number, because 940610701 - 211 = 940608653 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 940610701.

It is a congruent number.

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

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

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

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

Almost surely, 2940610701 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 940610701 is about 30669.3772515844. The cubic root of 940610701 is about 979.7982025840.

The spelling of 940610701 in words is "nine hundred forty million, six hundred ten thousand, seven hundred one".