Base | Representation |
---|---|
bin | 111011011010111010010110… |
… | …010010001001101101000101 |
3 | 1021021022021222212020022201122 |
4 | 323122322112102021231011 |
5 | 233223144214431330112 |
6 | 2323451121231403325 |
7 | 106021523440451564 |
oct | 7332722622115505 |
9 | 1237267885208648 |
10 | 261334101433157 |
11 | 762a6196325055 |
12 | 25388371983545 |
13 | b2a8913c441cc |
14 | 48768d0949bdb |
15 | 2032d767a0872 |
hex | edae96489b45 |
261334101433157 has 2 divisors, whose sum is σ = 261334101433158. Its totient is φ = 261334101433156.
The previous prime is 261334101433151. The next prime is 261334101433169. The reversal of 261334101433157 is 751334101433162.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 166020158384161 + 95313943048996 = 12884881^2 + 9762886^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-261334101433157 is a prime.
It is a super-2 number, since 2×2613341014331572 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (261334101433151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130667050716578 + 130667050716579.
It is an arithmetic number, because the mean of its divisors is an integer number (130667050716579).
Almost surely, 2261334101433157 is an apocalyptic number.
It is an amenable number.
261334101433157 is a deficient number, since it is larger than the sum of its proper divisors (1).
261334101433157 is an equidigital number, since it uses as much as digits as its factorization.
261334101433157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320, while the sum is 44.
The spelling of 261334101433157 in words is "two hundred sixty-one trillion, three hundred thirty-four billion, one hundred one million, four hundred thirty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •