Base | Representation |
---|---|
bin | 11011111011101111110111… |
… | …01110101110011101110101 |
3 | 22001111022122221002002002102 |
4 | 31331313323232232131311 |
5 | 31022403033430132021 |
6 | 334350545013151445 |
7 | 15636631121265665 |
oct | 1575677356563565 |
9 | 261438587062072 |
10 | 61426550630261 |
11 | 18632943497933 |
12 | 6a80a6362b585 |
13 | 283766402a06b |
14 | 11250bd20c1a5 |
15 | 717ca3ad100b |
hex | 37ddfbbae775 |
61426550630261 has 2 divisors, whose sum is σ = 61426550630262. Its totient is φ = 61426550630260.
The previous prime is 61426550630173. The next prime is 61426550630273. The reversal of 61426550630261 is 16203605562416.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60318615448036 + 1107935182225 = 7766506^2 + 1052585^2 .
It is a cyclic number.
It is not a de Polignac number, because 61426550630261 - 234 = 61409370761077 is a prime.
It is a super-2 number, since 2×614265506302612 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61426550630281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30713275315130 + 30713275315131.
It is an arithmetic number, because the mean of its divisors is an integer number (30713275315131).
Almost surely, 261426550630261 is an apocalyptic number.
It is an amenable number.
61426550630261 is a deficient number, since it is larger than the sum of its proper divisors (1).
61426550630261 is an equidigital number, since it uses as much as digits as its factorization.
61426550630261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 61426550630261 in words is "sixty-one trillion, four hundred twenty-six billion, five hundred fifty million, six hundred thirty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •