Search a number
-
+
146650075534057 is a prime number
BaseRepresentation
bin100001010110000010100001…
…101010001001001011101001
3201020020121110220120211212011
4201112002201222021023221
5123210203323314042212
61235522040432515521
742614055403464034
oct4126024152111351
9636217426524764
10146650075534057
11427aaa47530087
12145459256abba1
1363aa072cc6104
14282dc89b1401b
1511e4a896074a7
hex8560a1a892e9

146650075534057 has 2 divisors, whose sum is σ = 146650075534058. Its totient is φ = 146650075534056.

The previous prime is 146650075534051. The next prime is 146650075534073. The reversal of 146650075534057 is 750435570056641.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 77715314665641 + 68934760868416 = 8815629^2 + 8302696^2 .

It is a cyclic number.

It is not a de Polignac number, because 146650075534057 - 23 = 146650075534049 is a prime.

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

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

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

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

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

Almost surely, 2146650075534057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 52920000, while the sum is 58.

The spelling of 146650075534057 in words is "one hundred forty-six trillion, six hundred fifty billion, seventy-five million, five hundred thirty-four thousand, fifty-seven".