Search a number
-
+
463291055135959 is a prime number
BaseRepresentation
bin110100101010111000101101…
…0110001001101110011010111
32020202101012012012111202121111
41221111301122301031303113
5441211030040103322314
64321200550022355451
7166404450144104641
oct15125613261156327
92222335165452544
10463291055135959
111246896a6718a56
1243b64ab0b8bb87
1316b6820b54077b
14825959a037891
1538863e4698ec4
hex1a55c5ac4dcd7

463291055135959 has 2 divisors, whose sum is σ = 463291055135960. Its totient is φ = 463291055135958.

The previous prime is 463291055135957. The next prime is 463291055136029. The reversal of 463291055135959 is 959531550192364.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 463291055135959 - 21 = 463291055135957 is a prime.

It is a super-2 number, since 2×4632910551359592 (a number of 30 digits) contains 22 as substring.

Together with 463291055135957, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

Almost surely, 2463291055135959 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 196830000, while the sum is 67.

The spelling of 463291055135959 in words is "four hundred sixty-three trillion, two hundred ninety-one billion, fifty-five million, one hundred thirty-five thousand, nine hundred fifty-nine".