Search a number
-
+
1105268479577 is a prime number
BaseRepresentation
bin10000000101010111001…
…000101001011001011001
310220122220001122021000222
4100011113020221121121
5121102042212321302
62203430415205425
7142565404031213
oct20052710513131
93818801567028
101105268479577
11396818273749
1215a260216875
13802c3449902
143b6d10955b3
151db3d28bda2
hex10157229659

1105268479577 has 2 divisors, whose sum is σ = 1105268479578. Its totient is φ = 1105268479576.

The previous prime is 1105268479559. The next prime is 1105268479639. The reversal of 1105268479577 is 7759748625011.

It is an a-pointer prime, because the next prime (1105268479639) can be obtained adding 1105268479577 to its sum of digits (62).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 696984540736 + 408283938841 = 834856^2 + 638971^2 .

It is a cyclic number.

It is not a de Polignac number, because 1105268479577 - 212 = 1105268475481 is a prime.

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

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

Almost surely, 21105268479577 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29635200, while the sum is 62.

The spelling of 1105268479577 in words is "one trillion, one hundred five billion, two hundred sixty-eight million, four hundred seventy-nine thousand, five hundred seventy-seven".