Search a number
-
+
141517588361 is a prime number
BaseRepresentation
bin1000001111001100011…
…0110000011110001001
3111112021121022100121112
42003303012300132021
54304312000311421
6145002353020105
713136636440112
oct2036306603611
9445247270545
10141517588361
1155020a977a6
1223515b54635
1310464101a86
146bc6dcd209
153a3409245b
hex20f31b0789

141517588361 has 2 divisors, whose sum is σ = 141517588362. Its totient is φ = 141517588360.

The previous prime is 141517588309. The next prime is 141517588363. The reversal of 141517588361 is 163885715141.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 119270076025 + 22247512336 = 345355^2 + 149156^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 141517588361 - 230 = 140443846537 is a prime.

Together with 141517588363, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2141517588361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 806400, while the sum is 50.

The spelling of 141517588361 in words is "one hundred forty-one billion, five hundred seventeen million, five hundred eighty-eight thousand, three hundred sixty-one".