Search a number
-
+
10001113013 is a prime number
BaseRepresentation
bin10010101000001110…
…01101111110110101
3221210222212011220002
421110013031332311
5130440241104023
64332222321045
7502560025613
oct112407157665
927728764802
1010001113013
114272405261
121b31429185
13c34cb9c68
146ac3726b3
153d802cb28
hex2541cdfb5

10001113013 has 2 divisors, whose sum is σ = 10001113014. Its totient is φ = 10001113012.

The previous prime is 10001113007. The next prime is 10001113063. The reversal of 10001113013 is 31031110001.

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., 9972618769 + 28494244 = 99863^2 + 5338^2 .

It is a cyclic number.

It is not a de Polignac number, because 10001113013 - 24 = 10001112997 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10001112985 and 10001113003.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10001113063) 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, 5000556506 + 5000556507.

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

Almost surely, 210001113013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9, while the sum is 11.

Adding to 10001113013 its reverse (31031110001), we get a palindrome (41032223014).

The spelling of 10001113013 in words is "ten billion, one million, one hundred thirteen thousand, thirteen".