Search a number
-
+
1164026111233 is a prime number
BaseRepresentation
bin10000111100000101010…
…111001110010100000001
311010021112222111012210211
4100330011113032110001
5123032411141024413
62250425103154121
7150045436456606
oct20740527162401
94107488435724
101164026111233
1140972a437007
12169719ba5941
13859c8699aab
14404a694a6ad
152042b8d583d
hex10f055ce501

1164026111233 has 2 divisors, whose sum is σ = 1164026111234. Its totient is φ = 1164026111232.

The previous prime is 1164026111177. The next prime is 1164026111239. The reversal of 1164026111233 is 3321116204611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 710165200369 + 453860910864 = 842713^2 + 673692^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1164026111233 - 233 = 1155436176641 is a prime.

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

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

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

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

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

Almost surely, 21164026111233 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 31.

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