Search a number
-
+
76826050537 is a prime number
BaseRepresentation
bin100011110001100110…
…0000111111111101001
321100022010202201212011
41013203030013333221
52224314432104122
655143212515521
75356551440425
oct1074314077751
9240263681764
1076826050537
112a644336955
1212a80a7bba1
1373246b7702
143a0b411b85
151ee9a19377
hex11e3307fe9

76826050537 has 2 divisors, whose sum is σ = 76826050538. Its totient is φ = 76826050536.

The previous prime is 76826050513. The next prime is 76826050583. The reversal of 76826050537 is 73505062867.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 69234239376 + 7591811161 = 263124^2 + 87131^2 .

It is a cyclic number.

It is not a de Polignac number, because 76826050537 - 211 = 76826048489 is a prime.

It is a super-4 number, since 4×768260505374 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 276826050537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2116800, while the sum is 49.

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