Search a number
-
+
76807561553 is a prime number
BaseRepresentation
bin100011110001000010…
…1100110000101010001
321100020211222101201222
41013202011212011101
52224300213432203
655141312334425
75356235333612
oct1074205460521
9240224871658
1076807561553
112a6349588a8
1212a76844415
137320912c98
143a08b9bc09
151ee80b6038
hex11e2166151

76807561553 has 2 divisors, whose sum is σ = 76807561554. Its totient is φ = 76807561552.

The previous prime is 76807561547. The next prime is 76807561559. The reversal of 76807561553 is 35516570867.

It is a happy number.

It is a balanced prime because it is at equal distance from previous prime (76807561547) and next prime (76807561559).

It can be written as a sum of positive squares in only one way, i.e., 59754335809 + 17053225744 = 244447^2 + 130588^2 .

It is a cyclic number.

It is not a de Polignac number, because 76807561553 - 26 = 76807561489 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 = 76807561495 and 76807561504.

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

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

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

Almost surely, 276807561553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5292000, while the sum is 53.

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