Search a number
-
+
146209951 is a prime number
BaseRepresentation
bin10001011011011…
…11110010011111
3101012010020100101
420231233302133
5244412204301
622301441531
73423523036
oct1055576237
9335106311
10146209951
1175593778
1240b702a7
13243a2a84
14155bd71d
15cc81701
hex8b6fc9f

146209951 has 2 divisors, whose sum is σ = 146209952. Its totient is φ = 146209950.

The previous prime is 146209913. The next prime is 146209957. The reversal of 146209951 is 159902641.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-146209951 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 2146209951 is an apocalyptic number.

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

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

146209951 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 19440, while the sum is 37.

The square root of 146209951 is about 12091.7306867131. The cubic root of 146209951 is about 526.8160250874.

The spelling of 146209951 in words is "one hundred forty-six million, two hundred nine thousand, nine hundred fifty-one".