Search a number
-
+
101001010010057 is a prime number
BaseRepresentation
bin10110111101110000100001…
…010100101101011111001001
3111020121121021001020210002122
4112331300201110231133021
5101214300032030310212
6554451120133141025
730163040116633103
oct2675604124553711
9436547231223078
10101001010010057
112a200319072623
12b3b2809a8a775
13444847b744c71
141ad2691450573
15ba2404a43272
hex5bdc2152d7c9

101001010010057 has 2 divisors, whose sum is σ = 101001010010058. Its totient is φ = 101001010010056.

The previous prime is 101001010010051. The next prime is 101001010010123. The reversal of 101001010010057 is 750010010100101.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 70227684998416 + 30773325011641 = 8380196^2 + 5547371^2 .

It is a cyclic number.

It is not a de Polignac number, because 101001010010057 - 214 = 101001009993673 is a prime.

It is a super-2 number, since 2×1010010100100572 (a number of 29 digits) contains 22 as substring.

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

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

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

Almost surely, 2101001010010057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 35, while the sum is 17.

Adding to 101001010010057 its reverse (750010010100101), we get a palindrome (851011020110158).

The spelling of 101001010010057 in words is "one hundred one trillion, one billion, ten million, ten thousand, fifty-seven".