Search a number
-
+
11001022131013 is a prime number
BaseRepresentation
bin1010000000010110000000…
…0001000010101101000101
31102221200120010222022110121
42200011200001002231011
52420220043131143023
635221444431221541
72213540404150165
oct240054001025505
942850503868417
1011001022131013
113561564219092
1212980a40778b1
1361a51310c5c5
142a06492045a5
151412662acd5d
hexa0160042b45

11001022131013 has 2 divisors, whose sum is σ = 11001022131014. Its totient is φ = 11001022131012.

The previous prime is 11001022130947. The next prime is 11001022131023. The reversal of 11001022131013 is 31013122010011.

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., 9970324086724 + 1030698044289 = 3157582^2 + 1015233^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 211001022131013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 11001022131013 its reverse (31013122010011), we get a palindrome (42014144141024).

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