Base | Representation |
---|---|
bin | 11000011100111110110110… |
… | …101110001100001011000101 |
3 | 112002210011210122200102122222 |
4 | 120130332312232030023011 |
5 | 103044003122412430331 |
6 | 1020421213223302125 |
7 | 31436565126300644 |
oct | 3034766656141305 |
9 | 462704718612588 |
10 | 107544751686341 |
11 | 312a3522706262 |
12 | 1008aa878aa945 |
13 | 480157122b4c8 |
14 | 1c7b29d93d35b |
15 | c67744840b7b |
hex | 61cfb6b8c2c5 |
107544751686341 has 2 divisors, whose sum is σ = 107544751686342. Its totient is φ = 107544751686340.
The previous prime is 107544751686311. The next prime is 107544751686343. The reversal of 107544751686341 is 143686157445701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97479011937316 + 10065739749025 = 9873146^2 + 3172655^2 .
It is a cyclic number.
It is not a de Polignac number, because 107544751686341 - 234 = 107527571817157 is a prime.
It is a Sophie Germain prime.
Together with 107544751686343, it forms a pair of twin primes.
It is a Chen 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 (107544751686343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53772375843170 + 53772375843171.
It is an arithmetic number, because the mean of its divisors is an integer number (53772375843171).
Almost surely, 2107544751686341 is an apocalyptic number.
It is an amenable number.
107544751686341 is a deficient number, since it is larger than the sum of its proper divisors (1).
107544751686341 is an equidigital number, since it uses as much as digits as its factorization.
107544751686341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67737600, while the sum is 62.
The spelling of 107544751686341 in words is "one hundred seven trillion, five hundred forty-four billion, seven hundred fifty-one million, six hundred eighty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •