Search a number
-
+
3093857316811 is a prime number
BaseRepresentation
bin101101000001011000010…
…001000010111111001011
3101221202210020100222111001
4231001120101002333023
5401142204433114221
610325144243315431
7436344445200202
oct55013021027713
911852706328431
103093857316811
11a93108886aa8
1241b73a67bb77
13195998837161
14a9a5a206239
155572955e391
hex2d058442fcb

3093857316811 has 2 divisors, whose sum is σ = 3093857316812. Its totient is φ = 3093857316810.

The previous prime is 3093857316779. The next prime is 3093857316817. The reversal of 3093857316811 is 1186137583903.

3093857316811 is digitally balanced in base 3, 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 (1186137583903) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 3093857316811 - 25 = 3093857316779 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 23093857316811 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 55.

The spelling of 3093857316811 in words is "three trillion, ninety-three billion, eight hundred fifty-seven million, three hundred sixteen thousand, eight hundred eleven".