Search a number
-
+
3105671629 is a prime number
BaseRepresentation
bin1011100100011100…
…1100100111001101
322000102212110120011
42321013030213031
522330022443004
61232101153221
7136650526144
oct27107144715
98012773504
103105671629
111354086075
127280bb811
133a6562728
1421667275b
151329b9004
hexb91cc9cd

3105671629 has 2 divisors, whose sum is σ = 3105671630. Its totient is φ = 3105671628.

The previous prime is 3105671609. The next prime is 3105671641. The reversal of 3105671629 is 9261765013.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2946861225 + 158810404 = 54285^2 + 12602^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 3105671629 - 213 = 3105663437 is a prime.

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

It is a congruent number.

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

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

Almost surely, 23105671629 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 68040, while the sum is 40.

The square root of 3105671629 is about 55728.5530854696. The cubic root of 3105671629 is about 1458.9884199673.

The spelling of 3105671629 in words is "three billion, one hundred five million, six hundred seventy-one thousand, six hundred twenty-nine".