Base | Representation |
---|---|
bin | 10001100110100110000110… |
… | …010100001110110110111001 |
3 | 101011010012001221022112212101 |
4 | 101212212012110032312321 |
5 | 40121413142433223311 |
6 | 432353452052143401 |
7 | 22210224646220356 |
oct | 2146460624166671 |
9 | 334105057275771 |
10 | 77419038961081 |
11 | 22739259202044 |
12 | 88243b3607b61 |
13 | 34277791ccabc |
14 | 151915c65b62d |
15 | 8e3ca82c1ec1 |
hex | 46698650edb9 |
77419038961081 has 2 divisors, whose sum is σ = 77419038961082. Its totient is φ = 77419038961080.
The previous prime is 77419038961007. The next prime is 77419038961087. The reversal of 77419038961081 is 18016983091477.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71944917741225 + 5474121219856 = 8482035^2 + 2339684^2 .
It is a cyclic number.
It is not a de Polignac number, because 77419038961081 - 29 = 77419038960569 is a prime.
It is a super-2 number, since 2×774190389610812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (77419038961087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38709519480540 + 38709519480541.
It is an arithmetic number, because the mean of its divisors is an integer number (38709519480541).
Almost surely, 277419038961081 is an apocalyptic number.
It is an amenable number.
77419038961081 is a deficient number, since it is larger than the sum of its proper divisors (1).
77419038961081 is an equidigital number, since it uses as much as digits as its factorization.
77419038961081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18289152, while the sum is 64.
The spelling of 77419038961081 in words is "seventy-seven trillion, four hundred nineteen billion, thirty-eight million, nine hundred sixty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •