Search a number
-
+
11000232021013 is a prime number
BaseRepresentation
bin1010000000010011000011…
…1011000000110000010101
31102221121112002020120022021
42200010300323000300111
52420211433344133023
635221234204333141
72213512001264404
oct240046073006025
942847462216267
1011000232021013
113561199222814
121297b035441b1
1361a4185101b1
142a05b22d163b
1514121bc3b35d
hexa0130ec0c15

11000232021013 has 2 divisors, whose sum is σ = 11000232021014. Its totient is φ = 11000232021012.

The previous prime is 11000232021011. The next prime is 11000232021041. The reversal of 11000232021013 is 31012023200011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7171721492049 + 3828510528964 = 2678007^2 + 1956658^2 .

It is a cyclic number.

It is not a de Polignac number, because 11000232021013 - 21 = 11000232021011 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 211000232021013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 11000232021013 its reverse (31012023200011), we get a palindrome (42012255221024).

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