Search a number
-
+
2000336963 is a prime number
BaseRepresentation
bin111011100111010…
…1011100001000011
312011101222122110012
41313032223201003
513044041240323
6530254055135
7100366404122
oct16716534103
95141878405
102000336963
11937157849
12479aaa4ab
1325b564851
1414d945ab9
15ba92c678
hex773ab843

2000336963 has 2 divisors, whose sum is σ = 2000336964. Its totient is φ = 2000336962.

The previous prime is 2000336927. The next prime is 2000336999. The reversal of 2000336963 is 3696330002.

It is a balanced prime because it is at equal distance from previous prime (2000336927) and next prime (2000336999).

It is a cyclic number.

It is not a de Polignac number, because 2000336963 - 28 = 2000336707 is a prime.

It is a Sophie Germain prime.

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

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

Almost surely, 22000336963 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 17496, while the sum is 32.

The square root of 2000336963 is about 44725.1267521960. The cubic root of 2000336963 is about 1259.9918037176.

Adding to 2000336963 its reverse (3696330002), we get a palindrome (5696666965).

The spelling of 2000336963 in words is "two billion, three hundred thirty-six thousand, nine hundred sixty-three".