Search a number
-
+
111210137469397 is a prime number
BaseRepresentation
bin11001010010010100100000…
…101111010100000111010101
3112120202120210200200200210001
4121102110200233110013111
5104034031330143010042
61032305122025331301
732265444610345141
oct3122244057240725
9476676720620701
10111210137469397
1132486a553a506a
121058132a036b31
134a090bcba8b65
141d66856974221
15cccc6e3b2bb7
hex652520bd41d5

111210137469397 has 2 divisors, whose sum is σ = 111210137469398. Its totient is φ = 111210137469396.

The previous prime is 111210137469317. The next prime is 111210137469407. The reversal of 111210137469397 is 793964731012111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 101863824603121 + 9346312866276 = 10092761^2 + 3057174^2 .

It is a cyclic number.

It is not a de Polignac number, because 111210137469397 - 27 = 111210137469269 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2111210137469397 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 111210137469397 in words is "one hundred eleven trillion, two hundred ten billion, one hundred thirty-seven million, four hundred sixty-nine thousand, three hundred ninety-seven".