Search a number
-
+
1110111001621 is a prime number
BaseRepresentation
bin10000001001110111110…
…001011001110000010101
310221010101112200212110021
4100021313301121300111
5121142001404022441
62205551123225141
7143126404552246
oct20116761316025
93833345625407
101110111001621
113988827a1186
1215b191b181b1
13808b578b97b
143ba30282ccd
151dd234883d1
hex10277c59c15

1110111001621 has 2 divisors, whose sum is σ = 1110111001622. Its totient is φ = 1110111001620.

The previous prime is 1110111001609. The next prime is 1110111001673. The reversal of 1110111001621 is 1261001110111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1100873100625 + 9237900996 = 1049225^2 + 96114^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110111001621 - 221 = 1110108904469 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1110111001595 and 1110111001604.

It is a congruent number.

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

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

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

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

Almost surely, 21110111001621 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1110111001621 its reverse (1261001110111), we get a palindrome (2371112111732).

The spelling of 1110111001621 in words is "one trillion, one hundred ten billion, one hundred eleven million, one thousand, six hundred twenty-one".