Search a number
-
+
21102001121213 is a prime number
BaseRepresentation
bin1001100110001001100010…
…10001111110011110111101
32202201022221201222202121222
410303010301101332132331
510231213344241334323
6112514043034403125
74305366155011025
oct463046121763675
982638851882558
1021102001121213
1167a6343561011
1224498615904a5
13ba0baa8397ac
1452d4b13d2a85
15268da136b9c8
hex13313147e7bd

21102001121213 has 2 divisors, whose sum is σ = 21102001121214. Its totient is φ = 21102001121212.

The previous prime is 21102001121209. The next prime is 21102001121323. The reversal of 21102001121213 is 31212110020112.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10798177179364 + 10303823941849 = 3286058^2 + 3209957^2 .

It is a cyclic number.

It is not a de Polignac number, because 21102001121213 - 22 = 21102001121209 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 21102001121191 and 21102001121200.

It is a congruent number.

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

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

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

Almost surely, 221102001121213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 17.

Adding to 21102001121213 its reverse (31212110020112), we get a palindrome (52314111141325).

The spelling of 21102001121213 in words is "twenty-one trillion, one hundred two billion, one million, one hundred twenty-one thousand, two hundred thirteen".