Search a number
-
+
11010010111123 is a prime number
BaseRepresentation
bin1010000000110111011110…
…1111011101110010010011
31102222112202112110000021211
42200031313233131302103
52420342000042023443
635225532343000551
72214306212546632
oct240156757356223
942875675400254
1011010010111123
11356535674a621
121299992139157
1361b31624182a
142a0c5cbab519
151415e03b319d
hexa0377bddc93

11010010111123 has 2 divisors, whose sum is σ = 11010010111124. Its totient is φ = 11010010111122.

The previous prime is 11010010111091. The next prime is 11010010111129. The reversal of 11010010111123 is 32111101001011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11010010111123 - 25 = 11010010111091 is a prime.

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

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

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

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

Almost surely, 211010010111123 is an apocalyptic number.

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

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

11010010111123 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 11010010111123 its reverse (32111101001011), we get a palindrome (43121111112134).

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