Search a number
-
+
485665701 = 3161888567
BaseRepresentation
bin11100111100101…
…010101110100101
31020211212101002120
4130330222232211
51443312300301
6120105300153
715015042663
oct3474525645
91224771076
10485665701
1122a166914
12116794659
1379806771
1448703c33
152c985e36
hex1cf2aba5

485665701 has 4 divisors (see below), whose sum is σ = 647554272. Its totient is φ = 323777132.

The previous prime is 485665681. The next prime is 485665721. The reversal of 485665701 is 107566584.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is an interprime number because it is at equal distance from previous prime (485665681) and next prime (485665721).

It is a cyclic number.

It is not a de Polignac number, because 485665701 - 26 = 485665637 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (485665721) 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 in 3 ways as a sum of consecutive naturals, for example, 80944281 + ... + 80944286.

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

Almost surely, 2485665701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 161888570.

The product of its (nonzero) digits is 201600, while the sum is 42.

The square root of 485665701 is about 22037.8243254637. The cubic root of 485665701 is about 786.0421071137.

The spelling of 485665701 in words is "four hundred eighty-five million, six hundred sixty-five thousand, seven hundred one".

Divisors: 1 3 161888567 485665701