Search a number
-
+
485020930 = 2548502093
BaseRepresentation
bin11100111010001…
…101010100000010
31020210122121122011
4130322031110002
51443131132210
6120043403134
715006416122
oct3472152402
91223577564
10485020930
11229866449
121165234aa
137963c144
14485b6c82
152c8a9d8a
hex1ce8d502

485020930 has 8 divisors (see below), whose sum is σ = 873037692. Its totient is φ = 194008368.

The previous prime is 485020919. The next prime is 485020933. The reversal of 485020930 is 39020584.

It can be written as a sum of positive squares in 2 ways, for example, as 480968761 + 4052169 = 21931^2 + 2013^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a junction number, because it is equal to n+sod(n) for n = 485020892 and 485020901.

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

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

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

Almost surely, 2485020930 is an apocalyptic number.

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

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

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

The sum of its prime factors is 48502100.

The product of its (nonzero) digits is 8640, while the sum is 31.

The square root of 485020930 is about 22023.1907315902. The cubic root of 485020930 is about 785.6941025748.

The spelling of 485020930 in words is "four hundred eighty-five million, twenty thousand, nine hundred thirty".

Divisors: 1 2 5 10 48502093 97004186 242510465 485020930