Base | Representation |
---|---|
bin | 11011111101111011001001… |
… | …01100100011110101110001 |
3 | 22001202110200011100020100002 |
4 | 31332331210230203311301 |
5 | 31030114203441123121 |
6 | 334445152535235345 |
7 | 15645216123360143 |
oct | 1576754454436561 |
9 | 261673604306302 |
10 | 61501326114161 |
11 | 1866162528970a |
12 | 6a93451818b55 |
13 | 284171c94411b |
14 | 1128974160c93 |
15 | 719bcd599e0b |
hex | 37ef64b23d71 |
61501326114161 has 2 divisors, whose sum is σ = 61501326114162. Its totient is φ = 61501326114160.
The previous prime is 61501326114157. The next prime is 61501326114167. The reversal of 61501326114161 is 16141162310516.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 59692621210000 + 1808704904161 = 7726100^2 + 1344881^2 .
It is a cyclic number.
It is not a de Polignac number, because 61501326114161 - 22 = 61501326114157 is a prime.
It is a super-2 number, since 2×615013261141612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (61501326114167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30750663057080 + 30750663057081.
It is an arithmetic number, because the mean of its divisors is an integer number (30750663057081).
Almost surely, 261501326114161 is an apocalyptic number.
It is an amenable number.
61501326114161 is a deficient number, since it is larger than the sum of its proper divisors (1).
61501326114161 is an equidigital number, since it uses as much as digits as its factorization.
61501326114161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 38.
Adding to 61501326114161 its reverse (16141162310516), we get a palindrome (77642488424677).
The spelling of 61501326114161 in words is "sixty-one trillion, five hundred one billion, three hundred twenty-six million, one hundred fourteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •