Search a number
-
+
1010001156517 is a prime number
BaseRepresentation
bin11101011001010001100…
…00101001100110100101
310120112222201100211001101
432230220300221212211
5113021440244002032
62051553234000101
7132653525115523
oct16545060514645
93515881324041
101010001156517
1135a38035a901
121438b3416031
137432029c532
1436c547cb313
151b4147a1de7
hexeb28c299a5

1010001156517 has 2 divisors, whose sum is σ = 1010001156518. Its totient is φ = 1010001156516.

The previous prime is 1010001156499. The next prime is 1010001156553. The reversal of 1010001156517 is 7156511000101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 855710102116 + 154291054401 = 925046^2 + 392799^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1010001156517 - 215 = 1010001123749 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 21010001156517 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1050, while the sum is 28.

Adding to 1010001156517 its reverse (7156511000101), we get a palindrome (8166512156618).

The spelling of 1010001156517 in words is "one trillion, ten billion, one million, one hundred fifty-six thousand, five hundred seventeen".