Search a number
-
+
31331221301 is a prime number
BaseRepresentation
bin11101001011011111…
…000111111100110101
32222212112012221200202
4131023133013330311
51003131243040201
622220544450245
72156262662342
oct351337077465
988775187622
1031331221301
1112318726326
1260a4919985
132c54111c03
1417331757c9
15c35934c6b
hex74b7c7f35

31331221301 has 2 divisors, whose sum is σ = 31331221302. Its totient is φ = 31331221300.

The previous prime is 31331221261. The next prime is 31331221303. The reversal of 31331221301 is 10312213313.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31249047076 + 82174225 = 176774^2 + 9065^2 .

It is a cyclic number.

It is not a de Polignac number, because 31331221301 - 26 = 31331221237 is a prime.

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

Together with 31331221303, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 231331221301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 324, while the sum is 20.

Adding to 31331221301 its reverse (10312213313), we get a palindrome (41643434614).

The spelling of 31331221301 in words is "thirty-one billion, three hundred thirty-one million, two hundred twenty-one thousand, three hundred one".