Search a number
-
+
485678569 = 811159879
BaseRepresentation
bin11100111100101…
…101110111101001
31020211220000202011
4130330231313221
51443313203234
6120105435521
715015125335
oct3474556751
91224800664
10485678569
1122a175552
1211679bba1
137980c58c
14487087c5
152c989b64
hex1cf2dde9

485678569 has 4 divisors (see below), whose sum is σ = 485746560. Its totient is φ = 485610580.

The previous prime is 485678537. The next prime is 485678597. The reversal of 485678569 is 965876584.

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 a cyclic number.

It is not a de Polignac number, because 485678569 - 25 = 485678537 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (485678509) 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, 21829 + ... + 38050.

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

Almost surely, 2485678569 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 67990.

The product of its digits is 14515200, while the sum is 58.

The square root of 485678569 is about 22038.1162761249. The cubic root of 485678569 is about 786.0490492692.

The spelling of 485678569 in words is "four hundred eighty-five million, six hundred seventy-eight thousand, five hundred sixty-nine".

Divisors: 1 8111 59879 485678569