110314051 has 2 divisors, whose sum is σ = 110314052. Its totient is φ = 110314050.

The previous prime is 110314031. The next prime is 110314063. The reversal of 110314051 is 150413011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110314051 - 2⁷ = 110313923 is a prime.

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

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

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

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

Almost surely, 2^110314051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 16.

The square root of 110314051 is about 10503.0496047577. The cubic root of 110314051 is about 479.5975373546.

Adding to 110314051 its reverse (150413011), we get a palindrome (260727062).

The spelling of 110314051 in words is "one hundred ten million, three hundred fourteen thousand, fifty-one".