Search a number
-
+
75867676057 is a prime number
BaseRepresentation
bin100011010101000010…
…0001101110110011001
321020211100102021020001
41012222010031312121
52220334111113212
654504135333001
75324033414635
oct1065204156631
9236740367201
1075867676057
112a1a2363a28
1212853b21161
137200c92c14
14395a01bdc5
151e9080b657
hex11aa10dd99

75867676057 has 2 divisors, whose sum is σ = 75867676058. Its totient is φ = 75867676056.

The previous prime is 75867676051. The next prime is 75867676097. The reversal of 75867676057 is 75067676857.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 64335278736 + 11532397321 = 253644^2 + 107389^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 75867676057 - 27 = 75867675929 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 75867676057.

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

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

Almost surely, 275867676057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 103723200, while the sum is 64.

The spelling of 75867676057 in words is "seventy-five billion, eight hundred sixty-seven million, six hundred seventy-six thousand, fifty-seven".