Search a number
-
+
10100110001131 is a prime number
BaseRepresentation
bin1001001011111001110101…
…1110000000001111101011
31022202120011000212020021001
42102332131132000033223
52310440011130014011
633251532041455431
72061465066330643
oct222763536001753
938676130766231
1010100110001131
113244483871647
1211715764a1577
135835896a0997
1426cbc2a25523
15127ad8b5a7c1
hex92f9d7803eb

10100110001131 has 2 divisors, whose sum is σ = 10100110001132. Its totient is φ = 10100110001130.

The previous prime is 10100110001101. The next prime is 10100110001141. The reversal of 10100110001131 is 13110001100101.

It is an a-pointer prime, because the next prime (10100110001141) can be obtained adding 10100110001131 to its sum of digits (10).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10100110001131 - 25 = 10100110001099 is a prime.

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

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

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

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

Almost surely, 210100110001131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 10100110001131 its reverse (13110001100101), we get a palindrome (23210111101232).

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