Base | Representation |
---|---|
bin | 11000010110101010011100… |
… | …100101111010010111110001 |
3 | 112001020122222102012002212011 |
4 | 120112222130211322113301 |
5 | 103014344322013034021 |
6 | 1015445521102002521 |
7 | 31363323401461063 |
oct | 3026523445722761 |
9 | 461218872162764 |
10 | 107110521611761 |
11 | 311463540a2228 |
12 | 1001a8a0b76441 |
13 | 479c62c04c485 |
14 | 1c6426960b733 |
15 | c5b2ccc9cde1 |
hex | 616a9c97a5f1 |
107110521611761 has 2 divisors, whose sum is σ = 107110521611762. Its totient is φ = 107110521611760.
The previous prime is 107110521611759. The next prime is 107110521611813. The reversal of 107110521611761 is 167116125011701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72031613276736 + 35078908335025 = 8487144^2 + 5922745^2 .
It is a cyclic number.
It is not a de Polignac number, because 107110521611761 - 21 = 107110521611759 is a prime.
It is a super-2 number, since 2×1071105216117612 (a number of 29 digits) contains 22 as substring.
Together with 107110521611759, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (107110521651761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53555260805880 + 53555260805881.
It is an arithmetic number, because the mean of its divisors is an integer number (53555260805881).
Almost surely, 2107110521611761 is an apocalyptic number.
It is an amenable number.
107110521611761 is a deficient number, since it is larger than the sum of its proper divisors (1).
107110521611761 is an equidigital number, since it uses as much as digits as its factorization.
107110521611761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 40.
The spelling of 107110521611761 in words is "one hundred seven trillion, one hundred ten billion, five hundred twenty-one million, six hundred eleven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •