Search a number
-
+
850530146551 is a prime number
BaseRepresentation
bin11000110000001111000…
…11000001100011110111
310000022100220112010221221
430120013203001203313
5102413341204142201
61450421140451211
7115306633650361
oct14300743014367
93008326463857
10850530146551
112a8787104798
12118a089a9b07
13622877c8087
142d247257d31
15171ce4a74a1
hexc6078c18f7

850530146551 has 2 divisors, whose sum is σ = 850530146552. Its totient is φ = 850530146550.

The previous prime is 850530146497. The next prime is 850530146567. The reversal of 850530146551 is 155641035058.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 850530146551 - 27 = 850530146423 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2850530146551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 360000, while the sum is 43.

The spelling of 850530146551 in words is "eight hundred fifty billion, five hundred thirty million, one hundred forty-six thousand, five hundred fifty-one".