Search a number
-
+
5525669719 is a prime number
BaseRepresentation
bin1010010010101101…
…10000011101010111
3112021002112002212001
411021112300131113
542304032412334
62312150140131
7253634263153
oct51126603527
915232462761
105525669719
112386107499
1210a2651647
136a0a3096b
143a5c1a063
15225190714
hex1495b0757

5525669719 has 2 divisors, whose sum is σ = 5525669720. Its totient is φ = 5525669718.

The previous prime is 5525669693. The next prime is 5525669759. The reversal of 5525669719 is 9179665255.

5525669719 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 5525669719 - 211 = 5525667671 is a prime.

It is a super-2 number, since 2×55256697192 = 61066051686947077922, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 25525669719 is an apocalyptic number.

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

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

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

The product of its digits is 5103000, while the sum is 55.

The square root of 5525669719 is about 74334.8486175899. The cubic root of 5525669719 is about 1767.9160594272.

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