Search a number
-
+
726630557 is a prime number
BaseRepresentation
bin101011010011111…
…000000010011101
31212122021122201212
4223103320002131
52442004134212
6200034114205
724002154302
oct5323700235
91778248655
10726630557
11343189324
1218341b965
13b7704813
146c70b0a9
1543bd2e22
hex2b4f809d

726630557 has 2 divisors, whose sum is σ = 726630558. Its totient is φ = 726630556.

The previous prime is 726630523. The next prime is 726630563. The reversal of 726630557 is 755036627.

726630557 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., 543542596 + 183087961 = 23314^2 + 13531^2 .

It is an emirp because it is prime and its reverse (755036627) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 726630557 - 26 = 726630493 is a prime.

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

It is equal to p37559264 and since 726630557 and 37559264 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

It is a weakly prime.

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

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

Almost surely, 2726630557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 264600, while the sum is 41.

The square root of 726630557 is about 26956.0857136195. The cubic root of 726630557 is about 899.0238622423.

The spelling of 726630557 in words is "seven hundred twenty-six million, six hundred thirty thousand, five hundred fifty-seven".