Search a number
-
+
50517490 = 255051749
BaseRepresentation
bin1100000010110…
…1010111110010
310112001112222011
43000231113302
5100413024430
65002433134
71152251212
oct300552762
9115045864
1050517490
11265745a1
1214b027aa
13a609b0a
1469d0242
15467d22a
hex302d5f2

50517490 has 8 divisors (see below), whose sum is σ = 90931500. Its totient is φ = 20206992.

The previous prime is 50517487. The next prime is 50517491. The reversal of 50517490 is 9471505.

50517490 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 48902049 + 1615441 = 6993^2 + 1271^2 .

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

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

Almost surely, 250517490 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5051756.

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

The square root of 50517490 is about 7107.5656873503. The cubic root of 50517490 is about 369.6697564610.

Adding to 50517490 its reverse (9471505), we get a palindrome (59988995).

The spelling of 50517490 in words is "fifty million, five hundred seventeen thousand, four hundred ninety".

Divisors: 1 2 5 10 5051749 10103498 25258745 50517490