Search a number
-
+
1110203299631 is a prime number
BaseRepresentation
bin10000001001111101010…
…001011111011100101111
310221010121222101002112002
4100021331101133130233
5121142144021042011
62210004221402515
7143131605225536
oct20117521373457
93833558332462
101110203299631
1139891a902028
1215b1b8a0943b
13808cb93688a
143ba3c62b31d
151dd2b61ac3b
hex1027d45f72f

1110203299631 has 2 divisors, whose sum is σ = 1110203299632. Its totient is φ = 1110203299630.

The previous prime is 1110203299613. The next prime is 1110203299643. The reversal of 1110203299631 is 1369923020111.

Together with previous prime (1110203299613) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1110203299631 - 218 = 1110203037487 is a prime.

It is a super-2 number, since 2×11102032996312 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 21110203299631 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 17496, while the sum is 38.

The spelling of 1110203299631 in words is "one trillion, one hundred ten billion, two hundred three million, two hundred ninety-nine thousand, six hundred thirty-one".