Search a number
-
+
146289047 is a prime number
BaseRepresentation
bin10001011100000…
…11000110010111
3101012021020211212
420232003012113
5244422222142
622303252035
73424302452
oct1056030627
9335236755
10146289047
1175638143
1240baa01b
13243cca88
1415600499
15cc99d82
hex8b83197

146289047 has 2 divisors, whose sum is σ = 146289048. Its totient is φ = 146289046.

The previous prime is 146289019. The next prime is 146289061. The reversal of 146289047 is 740982641.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 146289047 - 26 = 146288983 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 2146289047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 96768, while the sum is 41.

The square root of 146289047 is about 12095.0009094667. Note that the first 3 decimals coincide. The cubic root of 146289047 is about 526.9110061479.

It can be divided in two parts, 1462 and 89047, that added together give a palindrome (90509).

The spelling of 146289047 in words is "one hundred forty-six million, two hundred eighty-nine thousand, forty-seven".