Search a number
-
+
13055415661 is a prime number
BaseRepresentation
bin11000010100010100…
…11101010101101101
31020200212001211110101
430022022131111231
5203214141300121
65555250511101
7641345126221
oct141212352555
936625054411
1013055415661
11559a495022
122644295491
131300a05132
148bbc72781
1551624b491
hex30a29d56d

13055415661 has 2 divisors, whose sum is σ = 13055415662. Its totient is φ = 13055415660.

The previous prime is 13055415643. The next prime is 13055415673. The reversal of 13055415661 is 16651455031.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7681646025 + 5373769636 = 87645^2 + 73306^2 .

It is a cyclic number.

It is not a de Polignac number, because 13055415661 - 223 = 13047027053 is a prime.

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

It is a congruent number.

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

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

Almost surely, 213055415661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54000, while the sum is 37.

The spelling of 13055415661 in words is "thirteen billion, fifty-five million, four hundred fifteen thousand, six hundred sixty-one".