Search a number
-
+
2100323323057 is a prime number
BaseRepresentation
bin11110100100000101000…
…001101000110010110001
321102210022010212201001211
4132210011001220302301
5233402430232314212
64244513014000121
7304512653452261
oct36440501506261
97383263781054
102100323323057
1173a818840323
1229b082046041
131230a104971b
14739288357a1
153997a7d19a7
hex1e905068cb1

2100323323057 has 2 divisors, whose sum is σ = 2100323323058. Its totient is φ = 2100323323056.

The previous prime is 2100323323013. The next prime is 2100323323079. The reversal of 2100323323057 is 7503233230012.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1174631110416 + 925692212641 = 1083804^2 + 962129^2 .

It is a cyclic number.

It is not a de Polignac number, because 2100323323057 - 211 = 2100323321009 is a prime.

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

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

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

Almost surely, 22100323323057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22680, while the sum is 31.

Adding to 2100323323057 its reverse (7503233230012), we get a palindrome (9603556553069).

The spelling of 2100323323057 in words is "two trillion, one hundred billion, three hundred twenty-three million, three hundred twenty-three thousand, fifty-seven".