Search a number
-
+
6950013391 is a prime number
BaseRepresentation
bin1100111100100000…
…01100100111001111
3122221100200021001101
412132100030213033
5103213200412031
63105350523531
7334141065466
oct63620144717
918840607041
106950013391
112a47112a22
12141b6665a7
13869b53979
1449d0679dd
152aa243361
hex19e40c9cf

6950013391 has 2 divisors, whose sum is σ = 6950013392. Its totient is φ = 6950013390.

The previous prime is 6950013341. The next prime is 6950013403. The reversal of 6950013391 is 1933100596.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 6950013391 - 27 = 6950013263 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 6950013391.

It is a congruent number.

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

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

Almost surely, 26950013391 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 21870, while the sum is 37.

The square root of 6950013391 is about 83366.7403165075. The cubic root of 6950013391 is about 1908.3669228533.

The spelling of 6950013391 in words is "six billion, nine hundred fifty million, thirteen thousand, three hundred ninety-one".