Search a number
-
+
21113433302009 is a prime number
BaseRepresentation
bin1001100110011110110101…
…01100010010001111111001
32202202102110110122201110112
410303033122230102033321
510231410302411131014
6112523213301554105
74306252362646136
oct463173254221771
982672413581415
1021113433302009
11680017a744714
12244bb12115935
13ba1cb0162209
1452dc7784358d
1526931ed2973e
hex1333dab123f9

21113433302009 has 2 divisors, whose sum is σ = 21113433302010. Its totient is φ = 21113433302008.

The previous prime is 21113433301997. The next prime is 21113433302041. The reversal of 21113433302009 is 90020333431112.

It is an a-pointer prime, because the next prime (21113433302041) can be obtained adding 21113433302009 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 17202610645609 + 3910822656400 = 4147603^2 + 1977580^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 221113433302009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 32.

The spelling of 21113433302009 in words is "twenty-one trillion, one hundred thirteen billion, four hundred thirty-three million, three hundred two thousand, nine".