Search a number
-
+
50531315 = 527533671
BaseRepresentation
bin1100000011000…
…0101111110011
310112002020221012
43000300233303
5100414000230
65003021135
71152336422
oct300605763
9115066835
1050531315
1126583a1a
1214b0a7ab
13a6131b3
1469d52b9
154682395
hex3030bf3

50531315 has 8 divisors (see below), whose sum is σ = 60676128. Its totient is φ = 40399360.

The previous prime is 50531303. The next prime is 50531353. The reversal of 50531315 is 51313505.

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

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

It is not a de Polignac number, because 50531315 - 28 = 50531059 is a prime.

It is a Duffinian number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 11930 + ... + 15600.

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

Almost surely, 250531315 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6429.

The product of its (nonzero) digits is 1125, while the sum is 23.

The square root of 50531315 is about 7108.5381760247. The cubic root of 50531315 is about 369.7034755963.

The spelling of 50531315 in words is "fifty million, five hundred thirty-one thousand, three hundred fifteen".

Divisors: 1 5 2753 3671 13765 18355 10106263 50531315