Search a number
-
+
10010555561 is a prime number
BaseRepresentation
bin10010101001010110…
…01111010010101001
3221211122121220122002
421110223033102221
5131000200234221
64333200540345
7503033214116
oct112453172251
927748556562
1010010555561
114277774616
121b346216b5
13c36c44b76
146ad70d90d
153d8c9580b
hex254acf4a9

10010555561 has 2 divisors, whose sum is σ = 10010555562. Its totient is φ = 10010555560.

The previous prime is 10010555551. The next prime is 10010555567. The reversal of 10010555561 is 16555501001.

It is a happy number.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8881931536 + 1128624025 = 94244^2 + 33595^2 .

It is a cyclic number.

It is not a de Polignac number, because 10010555561 - 26 = 10010555497 is a prime.

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

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

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

Almost surely, 210010555561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3750, while the sum is 29.

The spelling of 10010555561 in words is "ten billion, ten million, five hundred fifty-five thousand, five hundred sixty-one".