Search a number
-
+
111001000009513 is a prime number
BaseRepresentation
bin11001001111010001101111…
…001011001101111100101001
3112120000120222112122221202111
4121033101233023031330221
5104022120022000301023
61032025053324002321
732244362154306325
oct3117215713157451
9476016875587674
10111001000009513
1132406294796029
12105488a23903a1
1349c24707ab5b3
141d5a6970d8985
15cc75cdb5d00d
hex64f46f2cdf29

111001000009513 has 2 divisors, whose sum is σ = 111001000009514. Its totient is φ = 111001000009512.

The previous prime is 111001000009499. The next prime is 111001000009547. The reversal of 111001000009513 is 315900000100111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 67457524842009 + 43543475167504 = 8213253^2 + 6598748^2 .

It is a cyclic number.

It is not a de Polignac number, because 111001000009513 - 225 = 111000966455081 is a prime.

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

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

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

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

Almost surely, 2111001000009513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 135, while the sum is 22.

Adding to 111001000009513 its reverse (315900000100111), we get a palindrome (426901000109624).

The spelling of 111001000009513 in words is "one hundred eleven trillion, one billion, nine thousand, five hundred thirteen".