Base | Representation |
---|---|
bin | 11000000011001110110111… |
… | …101010110110001011010001 |
3 | 111212112000101102020222111111 |
4 | 120003032313222312023101 |
5 | 102331010143202423243 |
6 | 1012544250325413321 |
7 | 31165003036200133 |
oct | 3003166752661321 |
9 | 455460342228444 |
10 | 105775241061073 |
11 | 3078103402a131 |
12 | ba43b4a26a241 |
13 | 470374088314c |
14 | 1c197985a7053 |
15 | c366cb87b39d |
hex | 6033b7ab62d1 |
105775241061073 has 2 divisors, whose sum is σ = 105775241061074. Its totient is φ = 105775241061072.
The previous prime is 105775241060971. The next prime is 105775241061097. The reversal of 105775241061073 is 370160142577501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83774901096769 + 22000339964304 = 9152863^2 + 4690452^2 .
It is an emirp because it is prime and its reverse (370160142577501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105775241061073 - 237 = 105637802107601 is a prime.
It is a super-2 number, since 2×1057752410610732 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105775241961073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52887620530536 + 52887620530537.
It is an arithmetic number, because the mean of its divisors is an integer number (52887620530537).
Almost surely, 2105775241061073 is an apocalyptic number.
It is an amenable number.
105775241061073 is a deficient number, since it is larger than the sum of its proper divisors (1).
105775241061073 is an equidigital number, since it uses as much as digits as its factorization.
105775241061073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1234800, while the sum is 49.
The spelling of 105775241061073 in words is "one hundred five trillion, seven hundred seventy-five billion, two hundred forty-one million, sixty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •