Search a number
-
+
1200956513 is a prime number
BaseRepresentation
bin100011110010101…
…0010010001100001
310002200210220121212
41013211102101201
54424421102023
6315100355505
741521650641
oct10745222141
93080726555
101200956513
115669aa449
12296245b95
13161a6a973
14b56dc521
1570678e78
hex47952461

1200956513 has 2 divisors, whose sum is σ = 1200956514. Its totient is φ = 1200956512.

The previous prime is 1200956509. The next prime is 1200956557. The reversal of 1200956513 is 3156590021.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1071383824 + 129572689 = 32732^2 + 11383^2 .

It is a cyclic number.

It is not a de Polignac number, because 1200956513 - 22 = 1200956509 is a prime.

It is a super-2 number, since 2×12009565132 = 2884593092234238338, which contains 22 as substring.

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

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

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

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

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

Almost surely, 21200956513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1200956513 is about 34654.8194772387. The cubic root of 1200956513 is about 1062.9408405125.

The spelling of 1200956513 in words is "one billion, two hundred million, nine hundred fifty-six thousand, five hundred thirteen".