Search a number
-
+
396504859967 is a prime number
BaseRepresentation
bin1011100010100011000…
…10000000010100111111
31101220110002211212012222
411301101202000110333
522444020221004332
6502052443115555
740434521462246
oct5612142002477
91356402755188
10396504859967
1114317a724a17
1264a18812bbb
132b50c4b3b48
1415295d0b95d
15a4a9b4b712
hex5c5188053f

396504859967 has 2 divisors, whose sum is σ = 396504859968. Its totient is φ = 396504859966.

The previous prime is 396504859853. The next prime is 396504860023. The reversal of 396504859967 is 769958405693.

It is a strong prime.

It is an emirp because it is prime and its reverse (769958405693) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 396504859967 - 28 = 396504859711 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2396504859967 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 440899200, while the sum is 71.

The spelling of 396504859967 in words is "three hundred ninety-six billion, five hundred four million, eight hundred fifty-nine thousand, nine hundred sixty-seven".