Base | Representation |
---|---|
bin | 10001011101001111101010… |
… | …111011001100111011001001 |
3 | 101001211202112000122220210022 |
4 | 101131033222323030323021 |
5 | 40030401213320211402 |
6 | 431142343454230225 |
7 | 22112626535416124 |
oct | 2135175273147311 |
9 | 331752460586708 |
10 | 76776481803977 |
11 | 225107a546852a |
12 | 873b9684b5375 |
13 | 33abcb679a937 |
14 | 14d600435b3bb |
15 | 8d21ec2012a2 |
hex | 45d3eaeccec9 |
76776481803977 has 2 divisors, whose sum is σ = 76776481803978. Its totient is φ = 76776481803976.
The previous prime is 76776481803919. The next prime is 76776481803979. The reversal of 76776481803977 is 77930818467767.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76776481803961 + 16 = 8762219^2 + 4^2 .
It is a cyclic number.
It is not a de Polignac number, because 76776481803977 - 228 = 76776213368521 is a prime.
It is a super-2 number, since 2×767764818039772 (a number of 29 digits) contains 22 as substring.
Together with 76776481803979, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (76776481803979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38388240901988 + 38388240901989.
It is an arithmetic number, because the mean of its divisors is an integer number (38388240901989).
Almost surely, 276776481803977 is an apocalyptic number.
It is an amenable number.
76776481803977 is a deficient number, since it is larger than the sum of its proper divisors (1).
76776481803977 is an equidigital number, since it uses as much as digits as its factorization.
76776481803977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4182119424, while the sum is 80.
The spelling of 76776481803977 in words is "seventy-six trillion, seven hundred seventy-six billion, four hundred eighty-one million, eight hundred three thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •