Search a number
-
+
11032100201123 is a prime number
BaseRepresentation
bin1010000010001001110001…
…1010011110001010100011
31110001122210000211212000022
42200202130122132022203
52421222220122413443
635244024334144055
72216020504324451
oct240423432361243
943048700755008
1011032100201123
113573761a59151
1212a211805202b
136204269476c1
142a1d568bd9d1
15141e84889e68
hexa089c69e2a3

11032100201123 has 2 divisors, whose sum is σ = 11032100201124. Its totient is φ = 11032100201122.

The previous prime is 11032100201113. The next prime is 11032100201173. The reversal of 11032100201123 is 32110200123011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11032100201123 - 24 = 11032100201107 is a prime.

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

It is a Sophie Germain prime.

It is not a weakly prime, because it can be changed into another prime (11032100201113) 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, 5516050100561 + 5516050100562.

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

Almost surely, 211032100201123 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 17.

Adding to 11032100201123 its reverse (32110200123011), we get a palindrome (43142300324134).

The spelling of 11032100201123 in words is "eleven trillion, thirty-two billion, one hundred million, two hundred one thousand, one hundred twenty-three".