Search a number
-
+
11001010111123 is a prime number
BaseRepresentation
bin1010000000010101111101…
…0011001100001010010011
31102221200112022100122021111
42200011133103030022103
52420220032042023443
635221443321434151
72213540200035604
oct240053723141223
942850468318244
1011001010111123
11356155845939a
1212980a003b957
1361a510791546
142a0647795dab
151412651d669d
hexa015f4cc293

11001010111123 has 2 divisors, whose sum is σ = 11001010111124. Its totient is φ = 11001010111122.

The previous prime is 11001010111073. The next prime is 11001010111139. The reversal of 11001010111123 is 32111101010011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11001010111123 - 213 = 11001010102931 is a prime.

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

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

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

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

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

Almost surely, 211001010111123 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 11001010111123 its reverse (32111101010011), we get a palindrome (43112111121134).

The spelling of 11001010111123 in words is "eleven trillion, one billion, ten million, one hundred eleven thousand, one hundred twenty-three".