Search a number
-
+
6941003131369 is a prime number
BaseRepresentation
bin110010100000001010000…
…0001101010100111101001
3220120112221102221112011201
41211000110001222213221
51402210133300200434
622432353001524201
71314320346104566
oct145002401524751
926515842845151
106941003131369
11223673235277a
12941267aa3661
133b46c29639c8
1419dd36aa786d
15c084109a614
hex6501406a9e9

6941003131369 has 2 divisors, whose sum is σ = 6941003131370. Its totient is φ = 6941003131368.

The previous prime is 6941003131303. The next prime is 6941003131397. The reversal of 6941003131369 is 9631313001496.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5774577211225 + 1166425920144 = 2403035^2 + 1080012^2 .

It is a cyclic number.

It is not a de Polignac number, because 6941003131369 - 27 = 6941003131241 is a prime.

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

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

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

Almost surely, 26941003131369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 314928, while the sum is 46.

The spelling of 6941003131369 in words is "six trillion, nine hundred forty-one billion, three million, one hundred thirty-one thousand, three hundred sixty-nine".