Search a number
-
+
485702011 = 3171532183
BaseRepresentation
bin11100111100110…
…011100101111011
31020211221012220101
4130330303211323
51443314431021
6120110140231
715015253564
oct3474634573
91224835811
10485702011
1122a191123
121167b1677
137981a152
144871316b
152c991a91
hex1cf3397b

485702011 has 4 divisors (see below), whose sum is σ = 487234512. Its totient is φ = 484169512.

The previous prime is 485702003. The next prime is 485702039. The reversal of 485702011 is 110207584.

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

It is a cyclic number.

It is not a de Polignac number, because 485702011 - 23 = 485702003 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2485702011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1532500.

The product of its (nonzero) digits is 2240, while the sum is 28.

The square root of 485702011 is about 22038.6481209715. The cubic root of 485702011 is about 786.0616956754.

Adding to 485702011 its reverse (110207584), we get a palindrome (595909595).

The spelling of 485702011 in words is "four hundred eighty-five million, seven hundred two thousand, eleven".

Divisors: 1 317 1532183 485702011