Search a number
-
+
1055615261 is a prime number
BaseRepresentation
bin111110111010110…
…110100100011101
32201120022210220112
4332322312210131
54130214142021
6252425255405
735105403341
oct7672664435
92646283815
101055615261
114a195a408
12255634565
1313a91041c
14a02a7621
1562a19d5b
hex3eeb691d

1055615261 has 2 divisors, whose sum is σ = 1055615262. Its totient is φ = 1055615260.

The previous prime is 1055615227. The next prime is 1055615263. The reversal of 1055615261 is 1625165501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 949009636 + 106605625 = 30806^2 + 10325^2 .

It is a cyclic number.

It is not a de Polignac number, because 1055615261 - 222 = 1051420957 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 21055615261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9000, while the sum is 32.

The square root of 1055615261 is about 32490.2333171062. The cubic root of 1055615261 is about 1018.2049875852.

The spelling of 1055615261 in words is "one billion, fifty-five million, six hundred fifteen thousand, two hundred sixty-one".