Base | Representation |
---|---|
bin | 10001100101111100101000… |
… | …000011101111010000100001 |
3 | 101010221221010111021120102001 |
4 | 101211330220003233100201 |
5 | 40120200443010443311 |
6 | 432321205213124001 |
7 | 22204060302414601 |
oct | 2145745003572041 |
9 | 333857114246361 |
10 | 77374507906081 |
11 | 22721387622351 |
12 | 8817846189601 |
13 | 34235004bc809 |
14 | 1516d363bcc01 |
15 | 8e2a4db154c1 |
hex | 465f280ef421 |
77374507906081 has 2 divisors, whose sum is σ = 77374507906082. Its totient is φ = 77374507906080.
The previous prime is 77374507906063. The next prime is 77374507906117. The reversal of 77374507906081 is 18060970547377.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60744627805456 + 16629880100625 = 7793884^2 + 4077975^2 .
It is an emirp because it is prime and its reverse (18060970547377) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 77374507906081 - 211 = 77374507904033 is a prime.
It is a super-2 number, since 2×773745079060812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (77374507906781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38687253953040 + 38687253953041.
It is an arithmetic number, because the mean of its divisors is an integer number (38687253953041).
Almost surely, 277374507906081 is an apocalyptic number.
It is an amenable number.
77374507906081 is a deficient number, since it is larger than the sum of its proper divisors (1).
77374507906081 is an equidigital number, since it uses as much as digits as its factorization.
77374507906081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62233920, while the sum is 64.
The spelling of 77374507906081 in words is "seventy-seven trillion, three hundred seventy-four billion, five hundred seven million, nine hundred six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •