Search a number
-
+
3104055601 is a prime number
BaseRepresentation
bin1011100100000100…
…0010000100110001
322000022211100210021
42321001002010301
522324114234401
61232002403441
7136631015533
oct27101020461
98008740707
103104055601
111353181a09
12727660581
133a6117cba
14216371853
1513279a2a1
hexb9042131

3104055601 has 2 divisors, whose sum is σ = 3104055602. Its totient is φ = 3104055600.

The previous prime is 3104055599. The next prime is 3104055673. The reversal of 3104055601 is 1065504013.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2944690225 + 159365376 = 54265^2 + 12624^2 .

It is a cyclic number.

It is not a de Polignac number, because 3104055601 - 21 = 3104055599 is a prime.

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

Together with 3104055599, it forms a pair of twin primes.

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

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

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

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

Almost surely, 23104055601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1800, while the sum is 25.

The square root of 3104055601 is about 55714.0520963967. The cubic root of 3104055601 is about 1458.7353158092.

Adding to 3104055601 its reverse (1065504013), we get a palindrome (4169559614).

The spelling of 3104055601 in words is "three billion, one hundred four million, fifty-five thousand, six hundred one".