Search a number
-
+
13350050561 is a prime number
BaseRepresentation
bin11000110111011100…
…11001101100000001
31021110101110211120002
430123232121230001
5204320103104221
610044413525345
7651553362131
oct143356315401
937411424502
1013350050561
115730834641
122706aa3855
131349a74c03
1490904aac1
1553204a80b
hex31bb99b01

13350050561 has 2 divisors, whose sum is σ = 13350050562. Its totient is φ = 13350050560.

The previous prime is 13350050557. The next prime is 13350050587. The reversal of 13350050561 is 16505005331.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12682138225 + 667912336 = 112615^2 + 25844^2 .

It is an emirp because it is prime and its reverse (16505005331) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 13350050561 - 22 = 13350050557 is a prime.

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

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

Almost surely, 213350050561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6750, while the sum is 29.

Adding to 13350050561 its reverse (16505005331), we get a palindrome (29855055892).

The spelling of 13350050561 in words is "thirteen billion, three hundred fifty million, fifty thousand, five hundred sixty-one".