Search a number
-
+
5602953599869 is a prime number
BaseRepresentation
bin101000110001000101000…
…0011110001101101111101
3201211122012110200121020011
41101202022003301231331
51213244322110143434
615525543352423221
71115541261540403
oct121421203615575
921748173617204
105602953599869
11187022126938a
12765a819a7b11
1331848290b2b2
14155281dd5473
159ab2ba19e64
hex5188a0f1b7d

5602953599869 has 2 divisors, whose sum is σ = 5602953599870. Its totient is φ = 5602953599868.

The previous prime is 5602953599849. The next prime is 5602953599923. The reversal of 5602953599869 is 9689953592065.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4727537004100 + 875416595769 = 2174290^2 + 935637^2 .

It is a cyclic number.

It is not a de Polignac number, because 5602953599869 - 211 = 5602953597821 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 5602953599795 and 5602953599804.

It is a congruent number.

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

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

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

Almost surely, 25602953599869 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1417176000, while the sum is 76.

The spelling of 5602953599869 in words is "five trillion, six hundred two billion, nine hundred fifty-three million, five hundred ninety-nine thousand, eight hundred sixty-nine".