Search a number
-
+
1164949479761 is a prime number
BaseRepresentation
bin10000111100111100011…
…001100110000101010001
311010100221022222012022012
4100330330121212011101
5123041304031323021
62251100450152305
7150110351124254
oct20747431460521
94110838865265
101164949479761
1140a06367a4a1
12169937282695
1385b14a85bc2
144055342b09b
15204829cb35b
hex10f3c666151

1164949479761 has 2 divisors, whose sum is σ = 1164949479762. Its totient is φ = 1164949479760.

The previous prime is 1164949479713. The next prime is 1164949479769. The reversal of 1164949479761 is 1679749494611.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 840624924736 + 324324555025 = 916856^2 + 569495^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1164949479761 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 21164949479761 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 82301184, while the sum is 68.

The spelling of 1164949479761 in words is "one trillion, one hundred sixty-four billion, nine hundred forty-nine million, four hundred seventy-nine thousand, seven hundred sixty-one".