Search a number
-
+
21101219697713 is a prime number
BaseRepresentation
bin1001100110001000000101…
…01101000101010000110001
32202201020221021121100002212
410303010002231011100301
510231210244220311323
6112513433322021505
74305340616014301
oct463040255052061
982636837540085
1021101219697713
1167a5a82458a71
122449683947895
13ba0ab498c11c
1452d439701601
15268d57963b78
hex133102b45431

21101219697713 has 2 divisors, whose sum is σ = 21101219697714. Its totient is φ = 21101219697712.

The previous prime is 21101219697661. The next prime is 21101219697737. The reversal of 21101219697713 is 31779691210112.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 21100729163809 + 490533904 = 4593553^2 + 22148^2 .

It is a cyclic number.

It is not a de Polignac number, because 21101219697713 - 28 = 21101219697457 is a prime.

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

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

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

Almost surely, 221101219697713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 285768, while the sum is 50.

The spelling of 21101219697713 in words is "twenty-one trillion, one hundred one billion, two hundred nineteen million, six hundred ninety-seven thousand, seven hundred thirteen".