Search a number
-
+
3364045393 is a prime number
BaseRepresentation
bin1100100010000011…
…0100001001010001
322200110001012201211
43020200310021101
523342143423033
61313451100121
7146235625342
oct31040641121
98613035654
103364045393
111476a09105
1279a741641
13417c47707
1423cacc0c9
1514a5042cd
hexc8834251

3364045393 has 2 divisors, whose sum is σ = 3364045394. Its totient is φ = 3364045392.

The previous prime is 3364045339. The next prime is 3364045417. The reversal of 3364045393 is 3935404633.

Together with previous prime (3364045339) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2986403904 + 377641489 = 54648^2 + 19433^2 .

It is a cyclic number.

It is not a de Polignac number, because 3364045393 - 221 = 3361948241 is a prime.

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

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

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

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

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

Almost surely, 23364045393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 349920, while the sum is 40.

The square root of 3364045393 is about 58000.3913176454. The cubic root of 3364045393 is about 1498.3753362063.

The spelling of 3364045393 in words is "three billion, three hundred sixty-four million, forty-five thousand, three hundred ninety-three".