Search a number
-
+
693803891513 is a prime number
BaseRepresentation
bin10100001100010011110…
…11110011101100111001
32110022211101102110210102
422012021323303230321
542331402244012023
61250421253125145
7101061051526205
oct12061173635471
92408741373712
10693803891513
11248271233687
12b25696297b5
135056b87a265
142581a447b05
15130aa133628
hexa189ef3b39

693803891513 has 2 divisors, whose sum is σ = 693803891514. Its totient is φ = 693803891512.

The previous prime is 693803891441. The next prime is 693803891549. The reversal of 693803891513 is 315198308396.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 546191946304 + 147611945209 = 739048^2 + 384203^2 .

It is a cyclic number.

It is not a de Polignac number, because 693803891513 - 28 = 693803891257 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2693803891513 is an apocalyptic number.

It is an amenable number.

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

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

693803891513 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 4199040, while the sum is 56.

The spelling of 693803891513 in words is "six hundred ninety-three billion, eight hundred three million, eight hundred ninety-one thousand, five hundred thirteen".