Base | Representation |
---|---|
bin | 111011011000111010000110… |
… | …010011010110111111101101 |
3 | 1021020211010112211002020101222 |
4 | 323120322012103112333231 |
5 | 233213420203424021223 |
6 | 2323303544515113125 |
7 | 106005550100606552 |
oct | 7330720623267755 |
9 | 1236733484066358 |
10 | 261196394360813 |
11 | 7625285027144a |
12 | 2536573bba27a5 |
13 | b29893941c252 |
14 | 486dd89a68a29 |
15 | 202e4b70050c8 |
hex | ed8e864d6fed |
261196394360813 has 2 divisors, whose sum is σ = 261196394360814. Its totient is φ = 261196394360812.
The previous prime is 261196394360779. The next prime is 261196394360851. The reversal of 261196394360813 is 318063493691162.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 159019615648804 + 102176778712009 = 12610298^2 + 10108253^2 .
It is a cyclic number.
It is not a de Polignac number, because 261196394360813 - 26 = 261196394360749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (261196394360513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130598197180406 + 130598197180407.
It is an arithmetic number, because the mean of its divisors is an integer number (130598197180407).
Almost surely, 2261196394360813 is an apocalyptic number.
It is an amenable number.
261196394360813 is a deficient number, since it is larger than the sum of its proper divisors (1).
261196394360813 is an equidigital number, since it uses as much as digits as its factorization.
261196394360813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30233088, while the sum is 62.
The spelling of 261196394360813 in words is "two hundred sixty-one trillion, one hundred ninety-six billion, three hundred ninety-four million, three hundred sixty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •