Search a number
-
+
1000011010997 is a prime number
BaseRepresentation
bin11101000110101010100…
…11010001001110110101
310112121012111010211201202
432203111103101032311
5112341010304322442
62043222042302245
7132151130226035
oct16432523211665
93477174124652
101000011010997
11356114166699
121419857b7985
13733ba65261b
1436587ab18c5
151b02c6ddc32
hexe8d54d13b5

1000011010997 has 2 divisors, whose sum is σ = 1000011010998. Its totient is φ = 1000011010996.

The previous prime is 1000011010969. The next prime is 1000011011003. The reversal of 1000011010997 is 7990101100001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 853934935396 + 146076075601 = 924086^2 + 382199^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1000011010997 - 214 = 1000010994613 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21000011010997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 567, while the sum is 29.

Adding to 1000011010997 its reverse (7990101100001), we get a palindrome (8990112110998).

The spelling of 1000011010997 in words is "one trillion, eleven million, ten thousand, nine hundred ninety-seven".