Search a number
-
+
336161165126603 is a prime number
BaseRepresentation
bin100110001101111001001111…
…0110101011010101111001011
31122002020200201120210121110112
41030123302132311122233023
5323030131031233022403
63150542150214304535
7130543562022515315
oct11433623665325713
91562220646717415
10336161165126603
1198125171012a33
123185235205814b
1311575b2864499b
145d024041387b5
1528ce4cb4aa9d8
hex131bc9ed5abcb

336161165126603 has 2 divisors, whose sum is σ = 336161165126604. Its totient is φ = 336161165126602.

The previous prime is 336161165126519. The next prime is 336161165126609. The reversal of 336161165126603 is 306621561161633.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 336161165126603 - 212 = 336161165122507 is a prime.

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

It is a Sophie Germain prime.

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

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

Almost surely, 2336161165126603 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2099520, while the sum is 50.

The spelling of 336161165126603 in words is "three hundred thirty-six trillion, one hundred sixty-one billion, one hundred sixty-five million, one hundred twenty-six thousand, six hundred three".