Search a number
-
+
485609460337 = 1373544594601
BaseRepresentation
bin1110001000100001001…
…01000101001001110001
31201102102221212112222001
413010100211011021301
530424012010212322
61011030320014001
750040566210251
oct7042045051161
91642387775861
10485609460337
11177a44976011
127a145761301
1336a3c960651
1419709d29961
15c9725a9827
hex7110945271

485609460337 has 4 divisors (see below), whose sum is σ = 489154055076. Its totient is φ = 482064865600.

The previous prime is 485609460313. The next prime is 485609460353. The reversal of 485609460337 is 733064906584.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 382027831056 + 103581629281 = 618084^2 + 321841^2 .

It is a cyclic number.

It is not a de Polignac number, because 485609460337 - 235 = 451249721969 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (485609460437) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1772297164 + ... + 1772297437.

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

Almost surely, 2485609460337 is an apocalyptic number.

It is an amenable number.

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

485609460337 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 3544594738.

The product of its (nonzero) digits is 13063680, while the sum is 55.

The spelling of 485609460337 in words is "four hundred eighty-five billion, six hundred nine million, four hundred sixty thousand, three hundred thirty-seven".

Divisors: 1 137 3544594601 485609460337