Search a number
-
+
15346504141 is a prime number
BaseRepresentation
bin11100100101011100…
…10001000111001101
31110121112011012000021
432102232101013031
5222412201113031
611014452502141
71052205063403
oct162256210715
943545135007
1015346504141
116565779781
122b8361a951
1315a7579ca7
14a58261473
155ec45c511
hex392b911cd

15346504141 has 2 divisors, whose sum is σ = 15346504142. Its totient is φ = 15346504140.

The previous prime is 15346504111. The next prime is 15346504157. The reversal of 15346504141 is 14140564351.

15346504141 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., 14682411241 + 664092900 = 121171^2 + 25770^2 .

It is a cyclic number.

It is not a de Polignac number, because 15346504141 - 25 = 15346504109 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 15346504097 and 15346504106.

It is a congruent number.

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

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

Almost surely, 215346504141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28800, while the sum is 34.

The spelling of 15346504141 in words is "fifteen billion, three hundred forty-six million, five hundred four thousand, one hundred forty-one".