Search a number
-
+
480736709 is a prime number
BaseRepresentation
bin11100101001110…
…111010111000101
31020111120221210022
4130221313113011
51441032033314
6115411504525
714625123515
oct3451672705
91214527708
10480736709
112273aa672
12114bb8145
137879c0bb
1447bbd845
152c31078e
hex1ca775c5

480736709 has 2 divisors, whose sum is σ = 480736710. Its totient is φ = 480736708.

The previous prime is 480736673. The next prime is 480736733. The reversal of 480736709 is 907637084.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 460960900 + 19775809 = 21470^2 + 4447^2 .

It is a cyclic number.

It is not a de Polignac number, because 480736709 - 28 = 480736453 is a prime.

It is a super-3 number, since 3×4807367093 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

Almost surely, 2480736709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 254016, while the sum is 44.

The square root of 480736709 is about 21925.7088596925. The cubic root of 480736709 is about 783.3738954500.

The spelling of 480736709 in words is "four hundred eighty million, seven hundred thirty-six thousand, seven hundred nine".