Search a number
-
+
19690795599569 is a prime number
BaseRepresentation
bin1000111101000100111101…
…11000001000011011010001
32120201102101101211111012222
410132202132320020123101
510040103222133141234
6105513454314430425
74101420162002453
oct436423670103321
976642341744188
1019690795599569
116301901861536
12226025b732415
13acaaac569953
144c107a8d82d3
152423095c242e
hex11e89ee086d1

19690795599569 has 2 divisors, whose sum is σ = 19690795599570. Its totient is φ = 19690795599568.

The previous prime is 19690795599551. The next prime is 19690795599571. The reversal of 19690795599569 is 96599559709691.

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., 15145640227600 + 4545155371969 = 3891740^2 + 2131937^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-19690795599569 is a prime.

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

Together with 19690795599571, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 219690795599569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16740391500, while the sum is 89.

The spelling of 19690795599569 in words is "nineteen trillion, six hundred ninety billion, seven hundred ninety-five million, five hundred ninety-nine thousand, five hundred sixty-nine".