Search a number
-
+
146561321 is a prime number
BaseRepresentation
bin10001011110001…
…01100100101001
3101012210002100002
420233011210221
5300004430241
622313152345
73426515324
oct1057054451
9335702302
10146561321
1175803765
12410bb6b5
132449699a
14156717bb
15cd0089b
hex8bc5929

146561321 has 2 divisors, whose sum is σ = 146561322. Its totient is φ = 146561320.

The previous prime is 146561299. The next prime is 146561333. The reversal of 146561321 is 123165641.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 146410000 + 151321 = 12100^2 + 389^2 .

It is a cyclic number.

It is not a de Polignac number, because 146561321 - 26 = 146561257 is a prime.

It is a Chen prime.

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

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

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

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

Almost surely, 2146561321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 4320, while the sum is 29.

The square root of 146561321 is about 12106.2513190500. The cubic root of 146561321 is about 527.2377001297.

Adding to 146561321 its product of digits (4320), we get a palindrome (146565641).

The spelling of 146561321 in words is "one hundred forty-six million, five hundred sixty-one thousand, three hundred twenty-one".