Search a number
-
+
1110431713 is a prime number
BaseRepresentation
bin100001000101111…
…1101011111100001
32212101110202221111
41002023331133201
54233232303323
6302104223321
736342341146
oct10213753741
92771422844
101110431713
1151a89a866
1226ba6ab41
13149093bb1
14a76963cd
1567746c0d
hex422fd7e1

1110431713 has 2 divisors, whose sum is σ = 1110431714. Its totient is φ = 1110431712.

The previous prime is 1110431711. The next prime is 1110431737. The reversal of 1110431713 is 3171340111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 718668864 + 391762849 = 26808^2 + 19793^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110431713 - 21 = 1110431711 is a prime.

It is a super-2 number, since 2×11104317132 = 2466117178472228738, which contains 22 as substring.

Together with 1110431711, it forms a pair of twin primes.

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

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

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

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

Almost surely, 21110431713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 252, while the sum is 22.

The square root of 1110431713 is about 33323.1408033517. The cubic root of 1110431713 is about 1035.5330208199.

Adding to 1110431713 its reverse (3171340111), we get a palindrome (4281771824).

The spelling of 1110431713 in words is "one billion, one hundred ten million, four hundred thirty-one thousand, seven hundred thirteen".