Search a number
-
+
5690998849513 is a prime number
BaseRepresentation
bin101001011010000100111…
…1101101111111111101001
3202011001110111100200222011
41102310021331233333221
51221220131201141023
620034224143555521
71125106154033335
oct122641175577751
922131414320864
105690998849513
1118a45a253960a
1277ab53bbbba1
1332387476a353
141596354567c5
159d08147150d
hex52d09f6ffe9

5690998849513 has 2 divisors, whose sum is σ = 5690998849514. Its totient is φ = 5690998849512.

The previous prime is 5690998849469. The next prime is 5690998849537. The reversal of 5690998849513 is 3159488990965.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5440290348249 + 250708501264 = 2332443^2 + 500708^2 .

It is a cyclic number.

It is not a de Polignac number, because 5690998849513 - 229 = 5690461978601 is a prime.

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

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

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

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

Almost surely, 25690998849513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 5690998849513 in words is "five trillion, six hundred ninety billion, nine hundred ninety-eight million, eight hundred forty-nine thousand, five hundred thirteen".