Search a number
-
+
111002099495681 is a prime number
BaseRepresentation
bin11001001111010010110000…
…101101011011001100000001
3112120000200211011112122020102
4121033102300231123030001
5104022124244432330211
61032025354401452145
732244431334632342
oct3117226055331401
9476020734478212
10111002099495681
11324067a938a289
1210548b4a641055
1349c25b750c424
141d5a75d1420c9
15cc7645441a3b
hex64f4b0b5b301

111002099495681 has 2 divisors, whose sum is σ = 111002099495682. Its totient is φ = 111002099495680.

The previous prime is 111002099495669. The next prime is 111002099495687. The reversal of 111002099495681 is 186594990200111.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76739632333456 + 34262467162225 = 8760116^2 + 5853415^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2111002099495681 is an apocalyptic number.

It is an amenable number.

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

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

111002099495681 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1399680, while the sum is 56.

The spelling of 111002099495681 in words is "one hundred eleven trillion, two billion, ninety-nine million, four hundred ninety-five thousand, six hundred eighty-one".