Search a number
BaseRepresentation
bin10000001001110001001…
…001111110000000001111
310221010002210211110021121
4100021301021332000033
5121141240000013124
62205532120141411
7143123556222346
oct20116111760017
93833083743247
101110000001039
11398826076866
1215b160907867
1380898796057
143ba1d62ab5d
151dd1885e2e4
hex1027127e00f

1110000001039 has 2 divisors, whose sum is σ = 1110000001040. Its totient is φ = 1110000001038.

The previous prime is 1110000000997. The next prime is 1110000001049. The reversal of 1110000001039 is 9301000000111.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1110000001039 - 27 = 1110000000911 is a prime.

It is a congruent number.

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

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

Almost surely, 21110000001039 is an apocalyptic number.

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

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

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

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

The spelling of 1110000001039 in words is "one trillion, one hundred ten billion, one thousand, thirty-nine".