Search a number
-
+
163939399363 is a prime number
BaseRepresentation
bin1001100010101110001…
…1001011011011000011
3120200011012220101000001
42120223203023123003
510141221441234423
6203151314140431
714562366621355
oct2305343133303
9520135811001
10163939399363
1163587576213
1227932b81717
13125c8460b6c
147d12bb10d5
1543e7741cad
hex262b8cb6c3

163939399363 has 2 divisors, whose sum is σ = 163939399364. Its totient is φ = 163939399362.

The previous prime is 163939399307. The next prime is 163939399367. The reversal of 163939399363 is 363993939361.

163939399363 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-163939399363 is a prime.

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

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

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

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

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

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

Almost surely, 2163939399363 is an apocalyptic number.

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

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

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

The product of its digits is 57395628, while the sum is 64.

The spelling of 163939399363 in words is "one hundred sixty-three billion, nine hundred thirty-nine million, three hundred ninety-nine thousand, three hundred sixty-three".