Search a number
-
+
1110021000113 is a prime number
BaseRepresentation
bin10000001001110010011…
…010000100101110110001
310221010011021100022121002
4100021302122010232301
5121141310334000423
62205534150211345
7143124232552214
oct20116232045661
93833137308532
101110021000113
11398836a09773
1215b167953b55
138089cc3913c
143ba2233577b
151dd1a60b228
hex10272684bb1

1110021000113 has 2 divisors, whose sum is σ = 1110021000114. Its totient is φ = 1110021000112.

The previous prime is 1110021000059. The next prime is 1110021000211. The reversal of 1110021000113 is 3110001200111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1109855929009 + 165071104 = 1053497^2 + 12848^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110021000113 - 210 = 1110020999089 is a prime.

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

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

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

Almost surely, 21110021000113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 1110021000113 its reverse (3110001200111), we get a palindrome (4220022200224).

The spelling of 1110021000113 in words is "one trillion, one hundred ten billion, twenty-one million, one hundred thirteen", and thus it is an aban number.