Search a number
-
+
5064353077639 is a prime number
BaseRepresentation
bin100100110110010001011…
…1101110101100110000111
3122221010222110210012002011
41021230202331311212013
51130433243341441024
614434310502155051
71031613250616242
oct111544275654607
918833873705064
105064353077639
111682864315249
12699609722a87
132a9749635b2b
1413718a41c259
158bb071e0094
hex49b22f75987

5064353077639 has 2 divisors, whose sum is σ = 5064353077640. Its totient is φ = 5064353077638.

The previous prime is 5064353077607. The next prime is 5064353077697. The reversal of 5064353077639 is 9367703534605.

It is an a-pointer prime, because the next prime (5064353077697) can be obtained adding 5064353077639 to its sum of digits (58).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 5064353077639 - 25 = 5064353077607 is a prime.

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

It is a congruent number.

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

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

Almost surely, 25064353077639 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 42865200, while the sum is 58.

The spelling of 5064353077639 in words is "five trillion, sixty-four billion, three hundred fifty-three million, seventy-seven thousand, six hundred thirty-nine".