Search a number
-
+
3012276961 is a prime number
BaseRepresentation
bin1011001110001011…
…1011001011100001
321202221010112011101
42303202323023201
522132120330321
61214523314401
7134434634401
oct26342731341
97687115141
103012276961
1113063962a1
1270097ba01
133900c2605
142080c0801
151296bb791
hexb38bb2e1

3012276961 has 2 divisors, whose sum is σ = 3012276962. Its totient is φ = 3012276960.

The previous prime is 3012276941. The next prime is 3012276983. The reversal of 3012276961 is 1696722103.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1658036961 + 1354240000 = 40719^2 + 36800^2 .

It is an emirp because it is prime and its reverse (1696722103) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 3012276961 - 27 = 3012276833 is a prime.

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

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

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

Almost surely, 23012276961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27216, while the sum is 37.

The square root of 3012276961 is about 54884.2141330274. The cubic root of 3012276961 is about 1444.2142750867.

The spelling of 3012276961 in words is "three billion, twelve million, two hundred seventy-six thousand, nine hundred sixty-one".