Search a number
-
+
146141 is a prime number
BaseRepresentation
bin100011101011011101
321102110122
4203223131
514134031
63044325
71146032
oct435335
9242418
10146141
119a886
12706a5
1351698
143b389
152d47b
hex23add

146141 has 2 divisors, whose sum is σ = 146142. Its totient is φ = 146140.

The previous prime is 146117. The next prime is 146161. The reversal of 146141 is 141641.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 143641 + 2500 = 379^2 + 50^2 .

It is a cyclic number.

It is not a de Polignac number, because 146141 - 26 = 146077 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a plaindrome in base 16.

It is a congruent number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 146141.

It is not a weakly prime, because it can be changed into another prime (146161) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73070 + 73071.

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

2146141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 96, while the sum is 17.

The square root of 146141 is about 382.2839258980. The cubic root of 146141 is about 52.6733198524.

Adding to 146141 its reverse (141641), we get a palindrome (287782).

The spelling of 146141 in words is "one hundred forty-six thousand, one hundred forty-one".