Search a number
-
+
1100021323001 is a prime number
BaseRepresentation
bin10000000000011110011…
…000010101010011111001
310220011100101012002101112
4100000132120111103321
5121010320424314001
62201202014330105
7142321360653506
oct20003630252371
93804311162345
101100021323001
113945753a5307
12159236ab9935
137c968332933
143b3542584ad
151d9327b3cbb
hex1001e6154f9

1100021323001 has 2 divisors, whose sum is σ = 1100021323002. Its totient is φ = 1100021323000.

The previous prime is 1100021322991. The next prime is 1100021323021. The reversal of 1100021323001 is 1003231200011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1099551474025 + 469848976 = 1048595^2 + 21676^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100021323001 - 26 = 1100021322937 is a prime.

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

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

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

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

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

Almost surely, 21100021323001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 14.

Adding to 1100021323001 its reverse (1003231200011), we get a palindrome (2103252523012).

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