Search a number
-
+
3034127101 is a prime number
BaseRepresentation
bin1011010011011001…
…0001101011111101
321211110020121220211
42310312101223331
522203214031401
61221023512421
7135121440415
oct26466215375
97743217824
103034127101
11131775a665
12708158711
133947a2ba5
1420ad6b645
1512b585951
hexb4d91afd

3034127101 has 2 divisors, whose sum is σ = 3034127102. Its totient is φ = 3034127100.

The previous prime is 3034127069. The next prime is 3034127123. The reversal of 3034127101 is 1017214303.

3034127101 = 389492 + 389502.

It is an a-pointer prime, because the next prime (3034127123) can be obtained adding 3034127101 to its sum of digits (22).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1517102500 + 1517024601 = 38950^2 + 38949^2 .

It is a cyclic number.

It is not a de Polignac number, because 3034127101 - 25 = 3034127069 is a prime.

It is a congruent number.

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

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

Almost surely, 23034127101 is an apocalyptic number.

3034127101 is the 38950-th centered square number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 504, while the sum is 22.

The square root of 3034127101 is about 55082.9111521895. The cubic root of 3034127101 is about 1447.6978292897.

The spelling of 3034127101 in words is "three billion, thirty-four million, one hundred twenty-seven thousand, one hundred one".