Search a number
-
+
100001111057 is a prime number
BaseRepresentation
bin101110100100010000…
…1111101110000010001
3100120010020201210022222
41131020201331300101
53114300241023212
6113535002510425
710140056263511
oct1351041756021
9316106653288
10100001111057
1139457024931
121746a205415
139578b0b383
144ba926d841
1529043a8c72
hex174887dc11

100001111057 has 2 divisors, whose sum is σ = 100001111058. Its totient is φ = 100001111056.

The previous prime is 100001111027. The next prime is 100001111129. The reversal of 100001111057 is 750111100001.

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., 52228703296 + 47772407761 = 228536^2 + 218569^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2100001111057 is an apocalyptic number.

It is an amenable number.

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

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

100001111057 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 100001111057 its reverse (750111100001), we get a palindrome (850112211058).

The spelling of 100001111057 in words is "one hundred billion, one million, one hundred eleven thousand, fifty-seven".