Search a number
-
+
1611245151101 is a prime number
BaseRepresentation
bin10111011100100101101…
…100011110001101111101
312201000220110000100022002
4113130211230132031331
5202344312224313401
63232110143232045
7224260104545105
oct27344554361575
95630813010262
101611245151101
115713639789a3
1222032a8a8625
13b8c2a885cc1
1457dadd74205
152bda394aa6b
hex17725b1e37d

1611245151101 has 2 divisors, whose sum is σ = 1611245151102. Its totient is φ = 1611245151100.

The previous prime is 1611245151077. The next prime is 1611245151119. The reversal of 1611245151101 is 1011515421161.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1086960545476 + 524284605625 = 1042574^2 + 724075^2 .

It is a cyclic number.

It is not a de Polignac number, because 1611245151101 - 26 = 1611245151037 is a prime.

It is a super-2 number, since 2×16112451511012 (a number of 25 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 21611245151101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1200, while the sum is 29.

The spelling of 1611245151101 in words is "one trillion, six hundred eleven billion, two hundred forty-five million, one hundred fifty-one thousand, one hundred one".