Search a number
-
+
1121001109913 is a prime number
BaseRepresentation
bin10000010100000000110…
…111110111100110011001
310222011111111100200121102
4100110000313313212121
5121331302241004123
62214551504121145
7143663311134146
oct20240067674631
93864444320542
101121001109913
113a24609a1783
121613110061b5
138192c9bb329
143c3847093cd
151e25e56c028
hex10500df7999

1121001109913 has 2 divisors, whose sum is σ = 1121001109914. Its totient is φ = 1121001109912.

The previous prime is 1121001109897. The next prime is 1121001110003. The reversal of 1121001109913 is 3199011001211.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 865696263184 + 255304846729 = 930428^2 + 505277^2 .

It is an emirp because it is prime and its reverse (3199011001211) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1121001109913 - 24 = 1121001109897 is a prime.

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

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

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

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

Almost surely, 21121001109913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 29.

The spelling of 1121001109913 in words is "one trillion, one hundred twenty-one billion, one million, one hundred nine thousand, nine hundred thirteen".