Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
112110110010497 is a prime number
BaseRepresentation
bin11001011111011010101011…
…010010000110110010000001
3112200221121210022210201111002
4121133122223102012302001
5104143303001130313442
61034234401252301345
732420455015622444
oct3137325322066201
9480847708721432
10112110110010497
11327a36a343a655
12106a7835011855
134a72c26a6c7a1
141d9823044d65b
15ce63942b8732
hex65f6ab486c81

112110110010497 has 2 divisors, whose sum is σ = 112110110010498. Its totient is φ = 112110110010496.

The previous prime is 112110110010433. The next prime is 112110110010511. The reversal of 112110110010497 is 794010011011211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 79721308685041 + 32388801325456 = 8928679^2 + 5691116^2 .

It is a cyclic number.

It is not a de Polignac number, because 112110110010497 - 26 = 112110110010433 is a prime.

It is not a weakly prime, because it can be changed into another prime (112110110010407) 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, 56055055005248 + 56055055005249.

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

Almost surely, 2112110110010497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 504, while the sum is 29.

The spelling of 112110110010497 in words is "one hundred twelve trillion, one hundred ten billion, one hundred ten million, ten thousand, four hundred ninety-seven".