Search a number
-
+
1010560100131 is a prime number
BaseRepresentation
bin11101011010010100001…
…00110110011100100011
310120121102200010002112201
432231022010312130203
5113024111341201011
62052124522034031
7133003423056661
oct16551204663443
93517380102481
101010560100131
1135a63791647a
12143a2a648917
13743ac0217ba
1436ca8b27c31
151b4488aecc1
hexeb4a136723

1010560100131 has 2 divisors, whose sum is σ = 1010560100132. Its totient is φ = 1010560100130.

The previous prime is 1010560100093. The next prime is 1010560100177. The reversal of 1010560100131 is 1310010650101.

1010560100131 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 1010560100131 - 27 = 1010560100003 is a prime.

It is a super-3 number, since 3×10105601001313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

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

Almost surely, 21010560100131 is an apocalyptic number.

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

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

1010560100131 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 90, while the sum is 19.

Adding to 1010560100131 its reverse (1310010650101), we get a palindrome (2320570750232).

The spelling of 1010560100131 in words is "one trillion, ten billion, five hundred sixty million, one hundred thousand, one hundred thirty-one".