Search a number
-
+
31103201110621 is a prime number
BaseRepresentation
bin1110001001001110001110…
…10000001110101001011101
311002010102210120012210110111
413010213013100032221131
513034043323441014441
6150052340251410021
76360063214200613
oct704470720165135
9132112716183414
1031103201110621
119a01880193912
1235a4013153911
131448033484703
1479758da4b6b3
1538e0eb7e7081
hex1c49c740ea5d

31103201110621 has 2 divisors, whose sum is σ = 31103201110622. Its totient is φ = 31103201110620.

The previous prime is 31103201110601. The next prime is 31103201110637. The reversal of 31103201110621 is 12601110230113.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28015203257721 + 3087997852900 = 5292939^2 + 1757270^2 .

It is a cyclic number.

It is not a de Polignac number, because 31103201110621 - 27 = 31103201110493 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 231103201110621 is an apocalyptic number.

It is an amenable number.

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

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

31103201110621 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 216, while the sum is 22.

Adding to 31103201110621 its reverse (12601110230113), we get a palindrome (43704311340734).

The spelling of 31103201110621 in words is "thirty-one trillion, one hundred three billion, two hundred one million, one hundred ten thousand, six hundred twenty-one".