Search a number
-
+
9990561701 is a prime number
BaseRepresentation
bin10010100110111101…
…11101111110100101
3221210021000010012202
421103132331332211
5130430040433301
64331204224245
7502401242021
oct112336757645
927707003182
109990561701
11426745896a
121b2999b085
13c32a64493
146aabc7381
153d714666b
hex2537bdfa5

9990561701 has 2 divisors, whose sum is σ = 9990561702. Its totient is φ = 9990561700.

The previous prime is 9990561677. The next prime is 9990561709. The reversal of 9990561701 is 1071650999.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8756093476 + 1234468225 = 93574^2 + 35135^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-9990561701 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 29990561701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 153090, while the sum is 47.

The square root of 9990561701 is about 99952.7973645560. The cubic root of 9990561701 is about 2153.7566700493.

The spelling of 9990561701 in words is "nine billion, nine hundred ninety million, five hundred sixty-one thousand, seven hundred one".