Search a number
-
+
101113213057 is a prime number
BaseRepresentation
bin101111000101011010…
…0010011000010000001
3100122222202100102110221
41132022310103002001
53124034440304212
6114241211023041
710206452062423
oct1361264230201
9318882312427
10101113213057
113997785559a
121771a73aa81
1396c53385ac
144c72c3c813
15296bd30807
hex178ad13081

101113213057 has 2 divisors, whose sum is σ = 101113213058. Its totient is φ = 101113213056.

The previous prime is 101113213009. The next prime is 101113213067. The reversal of 101113213057 is 750312311101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 86723771121 + 14389441936 = 294489^2 + 119956^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101113213057 is a prime.

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

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

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

Almost surely, 2101113213057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 630, while the sum is 25.

Adding to 101113213057 its reverse (750312311101), we get a palindrome (851425524158).

The spelling of 101113213057 in words is "one hundred one billion, one hundred thirteen million, two hundred thirteen thousand, fifty-seven".