Search a number
-
+
11011001100971 is a prime number
BaseRepresentation
bin1010000000111011001011…
…0011110010101010101011
31102222122022121011111210112
42200032302303302222223
52420401012240212341
635230214543204535
72214342605043104
oct240166263625253
942878277144715
1011011001100971
1135658150799a3
12129a009ba674b
1361b443645861
142a0d146513ab
1514164c3b4aeb
hexa03b2cf2aab

11011001100971 has 2 divisors, whose sum is σ = 11011001100972. Its totient is φ = 11011001100970.

The previous prime is 11011001100941. The next prime is 11011001100977. The reversal of 11011001100971 is 17900110011011.

11011001100971 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11011001100971 - 230 = 11009927359147 is a prime.

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

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

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

Almost surely, 211011001100971 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 63, while the sum is 23.

Adding to 11011001100971 its reverse (17900110011011), we get a palindrome (28911111111982).

The spelling of 11011001100971 in words is "eleven trillion, eleven billion, one million, one hundred thousand, nine hundred seventy-one".