Search a number
-
+
11010131024213 is a prime number
BaseRepresentation
bin1010000000110111111011…
…1100101101100101010101
31102222120001221222000212102
42200031332330231211111
52420342222020233323
635225552342331445
72214312211363136
oct240157674554525
942876057860772
1011010131024213
113565408a253a2
121299a06729b85
1361b3352c8239
142a0c70c83c8d
151415eace9328
hexa037ef2d955

11010131024213 has 2 divisors, whose sum is σ = 11010131024214. Its totient is φ = 11010131024212.

The previous prime is 11010131024197. The next prime is 11010131024267. The reversal of 11010131024213 is 31242013101011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9954132270289 + 1055998753924 = 3155017^2 + 1027618^2 .

It is a cyclic number.

It is not a de Polignac number, because 11010131024213 - 24 = 11010131024197 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 211010131024213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 11010131024213 its reverse (31242013101011), we get a palindrome (42252144125224).

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