Search a number
-
+
1164026111033 is a prime number
BaseRepresentation
bin10000111100000101010…
…111001110010000111001
311010021112222111012112102
4100330011113032100321
5123032411141023113
62250425103153145
7150045436456202
oct20740527162071
94107488435472
101164026111033
1140972a436945
12169719ba57b5
13859c8699986
14404a694a5a9
152042b8d5758
hex10f055ce439

1164026111033 has 2 divisors, whose sum is σ = 1164026111034. Its totient is φ = 1164026111032.

The previous prime is 1164026111029. The next prime is 1164026111041. The reversal of 1164026111033 is 3301116204611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 696844291984 + 467181819049 = 834772^2 + 683507^2 .

It is a cyclic number.

It is not a de Polignac number, because 1164026111033 - 22 = 1164026111029 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1164026110987 and 1164026111005.

It is not a weakly prime, because it can be changed into another prime (1164026111233) 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, 582013055516 + 582013055517.

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

Almost surely, 21164026111033 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1164026111033 in words is "one trillion, one hundred sixty-four billion, twenty-six million, one hundred eleven thousand, thirty-three".