Search a number
-
+
110123023310297 is a prime number
BaseRepresentation
bin11001000010100000000011…
…101011111001110111011001
3112102220122202211121110122222
4121002200003223321313121
5103413223422431412142
61030113452444153425
732124061114431644
oct3102400353716731
9472818684543588
10110123023310297
11320a7a03837068
12104266b5838875
13495a73094211a
141d29da89daa5b
15cae844d13bd2
hex642803af9dd9

110123023310297 has 2 divisors, whose sum is σ = 110123023310298. Its totient is φ = 110123023310296.

The previous prime is 110123023310269. The next prime is 110123023310357. The reversal of 110123023310297 is 792013320321011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 81778941735241 + 28344081575056 = 9043171^2 + 5323916^2 .

It is an emirp because it is prime and its reverse (792013320321011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110123023310297 - 26 = 110123023310233 is a prime.

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

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

Almost surely, 2110123023310297 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608, while the sum is 35.

The spelling of 110123023310297 in words is "one hundred ten trillion, one hundred twenty-three billion, twenty-three million, three hundred ten thousand, two hundred ninety-seven".