Base | Representation |
---|---|
bin | 11011110001100100010111… |
… | …11011010011000100101001 |
3 | 22000020212211222200102220201 |
4 | 31320302023323103010221 |
5 | 31001140222311324021 |
6 | 333522141520552201 |
7 | 15602436415412551 |
oct | 1570621373230451 |
9 | 260225758612821 |
10 | 61076782526761 |
11 | 18508577516891 |
12 | 6a2510aa82661 |
13 | 2810692503001 |
14 | 11121bc4a2161 |
15 | 70db320d7591 |
hex | 378c8bed3129 |
61076782526761 has 2 divisors, whose sum is σ = 61076782526762. Its totient is φ = 61076782526760.
The previous prime is 61076782526719. The next prime is 61076782526789. The reversal of 61076782526761 is 16762528767016.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59961792250000 + 1114990276761 = 7743500^2 + 1055931^2 .
It is a cyclic number.
It is not a de Polignac number, because 61076782526761 - 27 = 61076782526633 is a prime.
It is a super-2 number, since 2×610767825267612 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 61076782526693 and 61076782526702.
It is not a weakly prime, because it can be changed into another prime (61076782526161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30538391263380 + 30538391263381.
It is an arithmetic number, because the mean of its divisors is an integer number (30538391263381).
Almost surely, 261076782526761 is an apocalyptic number.
It is an amenable number.
61076782526761 is a deficient number, since it is larger than the sum of its proper divisors (1).
61076782526761 is an equidigital number, since it uses as much as digits as its factorization.
61076782526761 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 71124480, while the sum is 64.
The spelling of 61076782526761 in words is "sixty-one trillion, seventy-six billion, seven hundred eighty-two million, five hundred twenty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •