Search a number
-
+
131013222911 is a prime number
BaseRepresentation
bin111101000000011111…
…1110010000111111111
3110112011112111022011022
41322000333302013333
54121303341113121
6140104152014355
712315426010004
oct1720077620777
9415145438138
10131013222911
115062060453a
12214840913bb
13c47ba9150c
1464abc998ab
15361bca7aab
hex1e80ff21ff

131013222911 has 2 divisors, whose sum is σ = 131013222912. Its totient is φ = 131013222910.

The previous prime is 131013222829. The next prime is 131013222913. The reversal of 131013222911 is 119222310131.

It is a strong prime.

It is an emirp because it is prime and its reverse (119222310131) is a distict prime.

It is a cyclic number.

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

It is a super-3 number, since 3×1310132229113 (a number of 34 digits) contains 333 as substring.

Together with 131013222913, 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 (131013222913) 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, 65506611455 + 65506611456.

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

Almost surely, 2131013222911 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 26.

The spelling of 131013222911 in words is "one hundred thirty-one billion, thirteen million, two hundred twenty-two thousand, nine hundred eleven".