Search a number
-
+
110535233545537 is a prime number
BaseRepresentation
bin11001001000011111111101…
…010101001010010101000001
3112111101001202110220001112121
4121020133331111022111001
5103442002124241424122
61031031104004124241
732165623062553303
oct3110377525122501
9474331673801477
10110535233545537
1132246802763969
1210492576096681
13498a573b43c18
141d41d106a5973
15cba41d659bc7
hex6487fd54a541

110535233545537 has 2 divisors, whose sum is σ = 110535233545538. Its totient is φ = 110535233545536.

The previous prime is 110535233545493. The next prime is 110535233545547. The reversal of 110535233545537 is 735545332535011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 59053015683216 + 51482217862321 = 7684596^2 + 7175111^2 .

It is a cyclic number.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110535233545537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14175000, while the sum is 52.

The spelling of 110535233545537 in words is "one hundred ten trillion, five hundred thirty-five billion, two hundred thirty-three million, five hundred forty-five thousand, five hundred thirty-seven".