Search a number
-
+
111680972569 is a prime number
BaseRepresentation
bin110100000000010110…
…1000110011100011001
3101200021020110020020101
41220000231012130121
53312210312110234
6123145554455401
711032362414055
oct1500055063431
9350236406211
10111680972569
11433aaaa7741
1219789894561
13a6ba84392a
145596554c65
152d8998d814
hex1a00b46719

111680972569 has 2 divisors, whose sum is σ = 111680972570. Its totient is φ = 111680972568.

The previous prime is 111680972567. The next prime is 111680972617. The reversal of 111680972569 is 965279086111.

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., 92180246544 + 19500726025 = 303612^2 + 139645^2 .

It is a cyclic number.

It is not a de Polignac number, because 111680972569 - 21 = 111680972567 is a prime.

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

Together with 111680972567, it forms a pair of twin primes.

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

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

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

Almost surely, 2111680972569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1632960, while the sum is 55.

The spelling of 111680972569 in words is "one hundred eleven billion, six hundred eighty million, nine hundred seventy-two thousand, five hundred sixty-nine".