Base | Representation |
---|---|
bin | 11011111111000101101010… |
… | …10000110100011000101001 |
3 | 22001220021221021102022101022 |
4 | 31333202311100310120221 |
5 | 31031243122110031212 |
6 | 334515410423102225 |
7 | 15651133406144432 |
oct | 1577426520643051 |
9 | 261807837368338 |
10 | 61541332502057 |
11 | 18677594900001 |
12 | 6a9b1578a1975 |
13 | 28454271220b5 |
14 | 112a88b512489 |
15 | 71ac708e4772 |
hex | 37f8b5434629 |
61541332502057 has 2 divisors, whose sum is σ = 61541332502058. Its totient is φ = 61541332502056.
The previous prime is 61541332502011. The next prime is 61541332502183. The reversal of 61541332502057 is 75020523314516.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53279065161001 + 8262267341056 = 7299251^2 + 2874416^2 .
It is a cyclic number.
It is not a de Polignac number, because 61541332502057 - 214 = 61541332485673 is a prime.
It is a super-2 number, since 2×615413325020572 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 61541332501999 and 61541332502017.
It is not a weakly prime, because it can be changed into another prime (61541332502557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30770666251028 + 30770666251029.
It is an arithmetic number, because the mean of its divisors is an integer number (30770666251029).
Almost surely, 261541332502057 is an apocalyptic number.
It is an amenable number.
61541332502057 is a deficient number, since it is larger than the sum of its proper divisors (1).
61541332502057 is an equidigital number, since it uses as much as digits as its factorization.
61541332502057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756000, while the sum is 44.
The spelling of 61541332502057 in words is "sixty-one trillion, five hundred forty-one billion, three hundred thirty-two million, five hundred two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •