Search a number
-
+
10056111061 is a prime number
BaseRepresentation
bin10010101110110010…
…00001001111010101
3221221211100101000211
421113121001033111
5131043331023221
64341505205421
7504125351023
oct112731011725
927854311024
1010056111061
1142a045a097
121b47930871
13c43505299
146b57ab713
153dcc936e1
hex2576413d5

10056111061 has 2 divisors, whose sum is σ = 10056111062. Its totient is φ = 10056111060.

The previous prime is 10056111001. The next prime is 10056111067. The reversal of 10056111061 is 16011165001.

10056111061 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., 9994000900 + 62110161 = 99970^2 + 7881^2 .

It is a cyclic number.

It is not a de Polignac number, because 10056111061 - 231 = 7908627413 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210056111061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 180, while the sum is 22.

Adding to 10056111061 its reverse (16011165001), we get a palindrome (26067276062).

The spelling of 10056111061 in words is "ten billion, fifty-six million, one hundred eleven thousand, sixty-one".