Search a number
-
+
3110100104431 is a prime number
BaseRepresentation
bin101101010000100000011…
…010010111010011101111
3102000022201020001002021201
4231100200122113103233
5401423441111320211
610340432114510331
7440461115463145
oct55204032272357
912008636032251
103110100104431
11a99a93479821
124229122953a7
131973869a8ca8
14aa75b4d7595
1555d7a5120c1
hex2d4206974ef

3110100104431 has 2 divisors, whose sum is σ = 3110100104432. Its totient is φ = 3110100104430.

The previous prime is 3110100104399. The next prime is 3110100104443. The reversal of 3110100104431 is 1344010010113.

3110100104431 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 3110100104431 - 25 = 3110100104399 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 23110100104431 is an apocalyptic number.

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

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

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

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

Adding to 3110100104431 its reverse (1344010010113), we get a palindrome (4454110114544).

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