Search a number
-
+
1010222213131 is a prime number
BaseRepresentation
bin11101011001101011110…
…11111010100000001011
310120120120010022122201101
432230311323322200023
5113022413341310011
62052031212002231
7132662151062455
oct16546573724013
93516503278641
101010222213131
1135a484114a1a
12143955460377
1374357019b71
1436c75cd12d5
151b428dba2c1
hexeb35efa80b

1010222213131 has 2 divisors, whose sum is σ = 1010222213132. Its totient is φ = 1010222213130.

The previous prime is 1010222213051. The next prime is 1010222213153. The reversal of 1010222213131 is 1313122220101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1010222213131 - 233 = 1001632278539 is a prime.

It is a super-3 number, since 3×10102222131313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 21010222213131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 19.

Adding to 1010222213131 its reverse (1313122220101), we get a palindrome (2323344433232).

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