Search a number
-
+
10061101111 is a prime number
BaseRepresentation
bin10010101111011000…
…00011100000110111
3221222011201220002111
421113230003200313
5131101120213421
64342204151451
7504215643205
oct112754034067
927864656074
1010061101111
1142a32581a6
121b49538587
13c44561689
146b630a075
153dd42bee1
hex257b03837

10061101111 has 2 divisors, whose sum is σ = 10061101112. Its totient is φ = 10061101110.

The previous prime is 10061101093. The next prime is 10061101123. The reversal of 10061101111 is 11110116001.

10061101111 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 is a cyclic number.

It is not a de Polignac number, because 10061101111 - 213 = 10061092919 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210061101111 is an apocalyptic number.

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

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

10061101111 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 13.

Adding to 10061101111 its reverse (11110116001), we get a palindrome (21171217112).

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