Search a number
-
+
110652142707551 is a prime number
BaseRepresentation
bin11001001010001100110101…
…101010001110001101011111
3112111210020112002002211102002
4121022030311222032031133
5104000411042013120201
61031200520445152515
732210232151210244
oct3112146552161537
9474706462084362
10110652142707551
1132291345954725
12104b116285b73b
1349985b5890573
141d4784131b5cb
15cbd4b20c676b
hex64a335a8e35f

110652142707551 has 2 divisors, whose sum is σ = 110652142707552. Its totient is φ = 110652142707550.

The previous prime is 110652142707497. The next prime is 110652142707593. The reversal of 110652142707551 is 155707241256011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110652142707551 - 210 = 110652142706527 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 110652142707496 and 110652142707505.

It is a congruent number.

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

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

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

Almost surely, 2110652142707551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 588000, while the sum is 47.

The spelling of 110652142707551 in words is "one hundred ten trillion, six hundred fifty-two billion, one hundred forty-two million, seven hundred seven thousand, five hundred fifty-one".