Search a number
-
+
26064241773949 is a prime number
BaseRepresentation
bin1011110110100100011011…
…10111110100110101111101
310102021201100211020022021001
411323102031313310311331
511404014031343231244
6131233425233210301
75330036131425511
oct573221567646575
9112251324208231
1026064241773949
118339867a96055
122b0b511a00991
131170b02b14812
14661731dcc141
15302ecdb535d4
hex17b48ddf4d7d

26064241773949 has 2 divisors, whose sum is σ = 26064241773950. Its totient is φ = 26064241773948.

The previous prime is 26064241773839. The next prime is 26064241773953. The reversal of 26064241773949 is 94937714246062.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 24310007748324 + 1754234025625 = 4930518^2 + 1324475^2 .

It is a cyclic number.

It is not a de Polignac number, because 26064241773949 - 27 = 26064241773821 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 226064241773949 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 109734912, while the sum is 64.

The spelling of 26064241773949 in words is "twenty-six trillion, sixty-four billion, two hundred forty-one million, seven hundred seventy-three thousand, nine hundred forty-nine".