Search a number
-
+
5216119426913 is a prime number
BaseRepresentation
bin100101111100111100011…
…1100100000111101100001
3200110122201022221112122012
41023321320330200331201
51140430103033130123
615032130245522305
71045565205402653
oct113717074407541
920418638845565
105216119426913
11173116448378a
12702b03a13395
132bab54b22775
141406666066d3
1590a3adcc378
hex4be78f20f61

5216119426913 has 2 divisors, whose sum is σ = 5216119426914. Its totient is φ = 5216119426912.

The previous prime is 5216119426909. The next prime is 5216119426963. The reversal of 5216119426913 is 3196249116125.

It is an a-pointer prime, because the next prime (5216119426963) can be obtained adding 5216119426913 to its sum of digits (50).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4379238431569 + 836880995344 = 2092663^2 + 914812^2 .

It is a cyclic number.

It is not a de Polignac number, because 5216119426913 - 22 = 5216119426909 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 25216119426913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 699840, while the sum is 50.

The spelling of 5216119426913 in words is "five trillion, two hundred sixteen billion, one hundred nineteen million, four hundred twenty-six thousand, nine hundred thirteen".