Search a number
-
+
1100233213297 is a prime number
BaseRepresentation
bin10000000000101011000…
…000101000010101110001
310220011220010220020020021
4100000223000220111301
5121011234200311142
62201235024043441
7142326543002461
oct20005300502561
93804803806207
101100233213297
11394673a69659
12159295a63581
137c9a01c0cca
143b374453ba1
151d9461bb267
hex1002b028571

1100233213297 has 2 divisors, whose sum is σ = 1100233213298. Its totient is φ = 1100233213296.

The previous prime is 1100233213213. The next prime is 1100233213459. The reversal of 1100233213297 is 7923123320011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 717017739361 + 383215473936 = 846769^2 + 619044^2 .

It is an emirp because it is prime and its reverse (7923123320011) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1100233213297 is a prime.

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

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

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

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

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

Almost surely, 21100233213297 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608, while the sum is 34.

The spelling of 1100233213297 in words is "one trillion, one hundred billion, two hundred thirty-three million, two hundred thirteen thousand, two hundred ninety-seven".