Search a number
-
+
463043540214751 is a prime number
BaseRepresentation
bin110100101001000101011100…
…1101110101110001111011111
32020201111112022110111222201111
41221102022321232232033133
5441143001132243333001
64320451133222522451
7166350535405016566
oct15122127156561737
92221445273458644
10463043540214751
111245a3731a27231
1243b24b34896427
1316b4aa84288502
14824b5d96b0bdd
15387ec59b0e851
hex1a522b9bae3df

463043540214751 has 2 divisors, whose sum is σ = 463043540214752. Its totient is φ = 463043540214750.

The previous prime is 463043540214727. The next prime is 463043540214769. The reversal of 463043540214751 is 157412045340364.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 463043540214751 - 223 = 463043531826143 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2463043540214751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4838400, while the sum is 49.

The spelling of 463043540214751 in words is "four hundred sixty-three trillion, forty-three billion, five hundred forty million, two hundred fourteen thousand, seven hundred fifty-one".