Search a number
-
+
1120202311073 is a prime number
BaseRepresentation
bin10000010011010001010…
…000101100010110100001
310222002102211021111121012
4100103101100230112201
5121323133242423243
62214340331110305
7143634441352436
oct20232120542641
93862384244535
101120202311073
113a209100134a
121611295a2395
13818333690b1
143c30a5b3b8d
151e214380d18
hex104d142c5a1

1120202311073 has 2 divisors, whose sum is σ = 1120202311074. Its totient is φ = 1120202311072.

The previous prime is 1120202311037. The next prime is 1120202311103. The reversal of 1120202311073 is 3701132020211.

Together with previous prime (1120202311037) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1116547262224 + 3655048849 = 1056668^2 + 60457^2 .

It is a cyclic number.

It is not a de Polignac number, because 1120202311073 - 26 = 1120202311009 is a prime.

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

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

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

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

Almost surely, 21120202311073 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 504, while the sum is 23.

Adding to 1120202311073 its reverse (3701132020211), we get a palindrome (4821334331284).

The spelling of 1120202311073 in words is "one trillion, one hundred twenty billion, two hundred two million, three hundred eleven thousand, seventy-three".