Search a number
-
+
3100232011 is a prime number
BaseRepresentation
bin1011100011001001…
…1100100101001011
322000001122002210211
42320302130211023
522322124411021
61231344421551
7136553352202
oct27062344513
98001562724
103100232011
111351000218
127263178b7
133a53a9816
14215a58239
151322923e1
hexb8c9c94b

3100232011 has 2 divisors, whose sum is σ = 3100232012. Its totient is φ = 3100232010.

The previous prime is 3100231993. The next prime is 3100232021. The reversal of 3100232011 is 1102320013.

3100232011 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 an emirp because it is prime and its reverse (1102320013) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 3100232011 - 227 = 2966014283 is a prime.

It is a super-2 number, since 2×31002320112 = 19222877044058208242, which contains 22 as substring.

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

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

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

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

Almost surely, 23100232011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 13.

The square root of 3100232011 is about 55679.7271096043. The cubic root of 3100232011 is about 1458.1361107448.

Adding to 3100232011 its reverse (1102320013), we get a palindrome (4202552024).

The spelling of 3100232011 in words is "three billion, one hundred million, two hundred thirty-two thousand, eleven".