Search a number
-
+
146110301 is a prime number
BaseRepresentation
bin10001011010101…
…11011101011101
3101011221011122122
420231113131131
5244401012201
622255352325
73422626361
oct1055273535
9334834578
10146110301
1175525917
1240b226a5
13243695cc
14155952a1
15cc61e1b
hex8b5775d

146110301 has 2 divisors, whose sum is σ = 146110302. Its totient is φ = 146110300.

The previous prime is 146110297. The next prime is 146110397. The reversal of 146110301 is 103011641.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 138415225 + 7695076 = 11765^2 + 2774^2 .

It is a cyclic number.

It is not a de Polignac number, because 146110301 - 22 = 146110297 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 146110301.

It is a congruent number.

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

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

Almost surely, 2146110301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 17.

The square root of 146110301 is about 12087.6093997118. The cubic root of 146110301 is about 526.6963133358.

Adding to 146110301 its reverse (103011641), we get a palindrome (249121942).

The spelling of 146110301 in words is "one hundred forty-six million, one hundred ten thousand, three hundred one".