Search a number
-
+
111013630367441 is a prime number
BaseRepresentation
bin11001001111011101100000…
…000000001101011011010001
3112120001210120202220121121212
4121033131200000031123101
5104022321403333224231
61032034542512225505
732245320151501304
oct3117354000153321
9476053522817555
10111013630367441
113241068624a96a
121054b22823b295
1349c370440a879
141d5b134722b3b
15cc7abc8e642b
hex64f76000d6d1

111013630367441 has 2 divisors, whose sum is σ = 111013630367442. Its totient is φ = 111013630367440.

The previous prime is 111013630367377. The next prime is 111013630367449. The reversal of 111013630367441 is 144763036310111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88668118140625 + 22345512226816 = 9416375^2 + 4727104^2 .

It is a cyclic number.

It is not a de Polignac number, because 111013630367441 - 26 = 111013630367377 is a prime.

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

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

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

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

Almost surely, 2111013630367441 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108864, while the sum is 41.

Adding to 111013630367441 its reverse (144763036310111), we get a palindrome (255776666677552).

The spelling of 111013630367441 in words is "one hundred eleven trillion, thirteen billion, six hundred thirty million, three hundred sixty-seven thousand, four hundred forty-one".