Search a number
-
+
1015060661 is a prime number
BaseRepresentation
bin111100100000001…
…001100010110101
32121202000102110022
4330200021202311
54034323420121
6244420134525
734103605346
oct7440114265
92552012408
101015060661
11480a8010a
12243b37445
131323b1314
1498b4c0cd
155e1a8aab
hex3c8098b5

1015060661 has 2 divisors, whose sum is σ = 1015060662. Its totient is φ = 1015060660.

The previous prime is 1015060643. The next prime is 1015060727. The reversal of 1015060661 is 1660605101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 862538161 + 152522500 = 29369^2 + 12350^2 .

It is a cyclic number.

It is not a de Polignac number, because 1015060661 - 210 = 1015059637 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 1015060661.

It is a congruent number.

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

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

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

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

Almost surely, 21015060661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 26.

The square root of 1015060661 is about 31860.0166509687. The cubic root of 1015060661 is about 1004.9952264981.

Adding to 1015060661 its reverse (1660605101), we get a palindrome (2675665762).

The spelling of 1015060661 in words is "one billion, fifteen million, sixty thousand, six hundred sixty-one".