Search a number
BaseRepresentation
bin1100010000100111
32112212211
430100213
53101330
61024251
7266254
oct142047
975784
1050215
1134800
1225087
1319b19
141442b
15ed2a
hexc427

50215 has 12 divisors (see below), whose sum is σ = 67032. Its totient is φ = 36080.

The previous prime is 50207. The next prime is 50221. The reversal of 50215 is 51205.

Subtracting 50215 from its reverse (51205), we obtain a triangular number (990 = T44).

50215 = T90 + T91 + ... + T100.

It is not a de Polignac number, because 50215 - 23 = 50207 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 564 + ... + 646.

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

250215 is an apocalyptic number.

50215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

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

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

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

The sum of its prime factors is 110 (or 99 counting only the distinct ones).

The product of its (nonzero) digits is 50, while the sum is 13.

The square root of 50215 is about 224.0870366621. The cubic root of 50215 is about 36.8930439318.

The spelling of 50215 in words is "fifty thousand, two hundred fifteen".

Divisors: 1 5 11 55 83 121 415 605 913 4565 10043 50215