Search a number
-
+
1164050510453 is a prime number
BaseRepresentation
bin10000111100000110110…
…100010011001001110101
311010021121200101211020122
4100330012310103021311
5123032433412313303
62250431334141325
7150046154040425
oct20740664231165
94107550354218
101164050510453
11409742191556
121697261b1845
1385a007606bc
14404a9c9c485
152042db04e38
hex10f06d13275

1164050510453 has 2 divisors, whose sum is σ = 1164050510454. Its totient is φ = 1164050510452.

The previous prime is 1164050510449. The next prime is 1164050510461. The reversal of 1164050510453 is 3540150504611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1133954506129 + 30096004324 = 1064873^2 + 173482^2 .

It is a cyclic number.

It is not a de Polignac number, because 1164050510453 - 22 = 1164050510449 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 21164050510453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36000, while the sum is 35.

The spelling of 1164050510453 in words is "one trillion, one hundred sixty-four billion, fifty million, five hundred ten thousand, four hundred fifty-three".