Search a number
-
+
397242613151963 is a prime number
BaseRepresentation
bin101101001010010100100000…
…0110110001011100011011011
31221002112000121201102221021122
41122110221000312023203123
5404031410332431330323
63524510423121155455
7146446555162302005
oct13224510066134333
91832460551387248
10397242613151963
11105634712037987
123867834348bb8b
1314086a825b8947
1470149060a7375
1530dd2d2e72ec8
hex1694a40d8b8db

397242613151963 has 2 divisors, whose sum is σ = 397242613151964. Its totient is φ = 397242613151962.

The previous prime is 397242613151957. The next prime is 397242613152019. The reversal of 397242613151963 is 369151316242793.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 397242613151963 - 210 = 397242613150939 is a prime.

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

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

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

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

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

Almost surely, 2397242613151963 is an apocalyptic number.

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

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

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

The product of its digits is 44089920, while the sum is 62.

The spelling of 397242613151963 in words is "three hundred ninety-seven trillion, two hundred forty-two billion, six hundred thirteen million, one hundred fifty-one thousand, nine hundred sixty-three".