[go: up one dir, main page]

Search a number
-
+
105542057 is a prime number
BaseRepresentation
bin1100100101001…
…11000110101001
321100121002111002
412102213012221
5204004321212
614250044345
72421043535
oct622470651
9240532432
10105542057
1154637345
122b4196b5
1318b3422a
1410034bc5
1593ebac2
hex64a71a9

105542057 has 2 divisors, whose sum is σ = 105542058. Its totient is φ = 105542056.

The previous prime is 105542039. The next prime is 105542117. The reversal of 105542057 is 750245501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96904336 + 8637721 = 9844^2 + 2939^2 .

It is an emirp because it is prime and its reverse (750245501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 105542057 - 218 = 105279913 is a prime.

It is a super-2 number, since 2×1055420572 = 22278251591582498, which contains 22 as substring.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (105542257) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52771028 + 52771029.

It is an arithmetic number, because the mean of its divisors is an integer number (52771029).

Almost surely, 2105542057 is an apocalyptic number.

It is an amenable number.

105542057 is a deficient number, since it is larger than the sum of its proper divisors (1).

105542057 is an equidigital number, since it uses as much as digits as its factorization.

105542057 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 7000, while the sum is 29.

The square root of 105542057 is about 10273.3663908185. The cubic root of 105542057 is about 472.5798332861.

Adding to 105542057 its reverse (750245501), we get a palindrome (855787558).

The spelling of 105542057 in words is "one hundred five million, five hundred forty-two thousand, fifty-seven".