Search a number
-
+
3112859957 is a prime number
BaseRepresentation
bin1011100110001010…
…0111100100110101
322000221101200002112
42321202213210311
522333343004312
61232515220405
7140065605314
oct27142474465
98027350075
103112859957
111358145839
1272a5a7705
133a7bab58c
142175c427b
15133438d22
hexb98a7935

3112859957 has 2 divisors, whose sum is σ = 3112859958. Its totient is φ = 3112859956.

The previous prime is 3112859917. The next prime is 3112859983. The reversal of 3112859957 is 7599582113.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2837266756 + 275593201 = 53266^2 + 16601^2 .

It is an emirp because it is prime and its reverse (7599582113) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-3112859957 is a prime.

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

It is a congruent number.

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

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

Almost surely, 23112859957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 680400, while the sum is 50.

The square root of 3112859957 is about 55793.0099295602. The cubic root of 3112859957 is about 1460.1132014873.

The spelling of 3112859957 in words is "three billion, one hundred twelve million, eight hundred fifty-nine thousand, nine hundred fifty-seven".