Search a number
-
+
1109201011013 is a prime number
BaseRepresentation
bin10000001001000001100…
…010000100000101000101
310221001001010101120000102
4100021001202010011011
5121133120424323023
62205320535053445
7143065015013354
oct20110142040505
93831033346012
101109201011013
11398456065827
1215ab79211285
138079c0a7aa4
143b98548599b
151dcbd636628
hex10241884145

1109201011013 has 2 divisors, whose sum is σ = 1109201011014. Its totient is φ = 1109201011012.

The previous prime is 1109201010959. The next prime is 1109201011099. The reversal of 1109201011013 is 3101101029011.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1108889029444 + 311981569 = 1053038^2 + 17663^2 .

It is a cyclic number.

It is not a de Polignac number, because 1109201011013 - 26 = 1109201010949 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21109201011013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1109201011013 in words is "one trillion, one hundred nine billion, two hundred one million, eleven thousand, thirteen".