Search a number
-
+
11307062461 is a prime number
BaseRepresentation
bin10101000011111010…
…00001010010111101
31002012000020021202011
422201331001102331
5141124101444321
65105553331221
7550125305452
oct124175012275
932160207664
1011307062461
1148825a6422
122236866b11
1310b2728c06
147939a1829
154629e5ae1
hex2a1f414bd

11307062461 has 2 divisors, whose sum is σ = 11307062462. Its totient is φ = 11307062460.

The previous prime is 11307062401. The next prime is 11307062477. The reversal of 11307062461 is 16426070311.

11307062461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10695489561 + 611572900 = 103419^2 + 24730^2 .

It is a cyclic number.

It is not a de Polignac number, because 11307062461 - 29 = 11307061949 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211307062461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6048, while the sum is 31.

The spelling of 11307062461 in words is "eleven billion, three hundred seven million, sixty-two thousand, four hundred sixty-one".