Search a number
-
+
10555151027 is a prime number
BaseRepresentation
bin10011101010010001…
…01101001010110011
31000020121101020011112
421311020231022303
5133104104313102
64503213303535
7522365206031
oct116510551263
930217336145
1010555151027
114527120213
122066a94bab
13cc2a123c5
14721b93551
1541b9bc252
hex27522d2b3

10555151027 has 2 divisors, whose sum is σ = 10555151028. Its totient is φ = 10555151026.

The previous prime is 10555151017. The next prime is 10555151071. The reversal of 10555151027 is 72015155501.

10555151027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10555151027 - 24 = 10555151011 is a prime.

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

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

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

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

Almost surely, 210555151027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8750, while the sum is 32.

The spelling of 10555151027 in words is "ten billion, five hundred fifty-five million, one hundred fifty-one thousand, twenty-seven".