Search a number
-
+
10555011133 is a prime number
BaseRepresentation
bin10011101010010000…
…01011000000111101
31000020121010010021021
421311020023000331
5133104040324013
64503210304141
7522364054132
oct116510130075
930217103237
1010555011133
1145270350a7
122066a28051
13cc2993824
14721b58589
1541b990a8d
hex27520b03d

10555011133 has 2 divisors, whose sum is σ = 10555011134. Its totient is φ = 10555011132.

The previous prime is 10555011113. The next prime is 10555011139. The reversal of 10555011133 is 33111055501.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10529427769 + 25583364 = 102613^2 + 5058^2 .

It is a cyclic number.

It is not a de Polignac number, because 10555011133 - 233 = 1965076541 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 210555011133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1125, while the sum is 25.

Adding to 10555011133 its reverse (33111055501), we get a palindrome (43666066634).

The spelling of 10555011133 in words is "ten billion, five hundred fifty-five million, eleven thousand, one hundred thirty-three".