Search a number
-
+
53050 = 2521061
BaseRepresentation
bin1100111100111010
32200202211
430330322
53144200
61045334
7310444
oct147472
980684
1053050
1136948
122684a
131b1ba
1415494
1510aba
hexcf3a

53050 has 12 divisors (see below), whose sum is σ = 98766. Its totient is φ = 21200.

The previous prime is 53047. The next prime is 53051. The reversal of 53050 is 5035.

It can be written as a sum of positive squares in 3 ways, for example, as 42849 + 10201 = 207^2 + 101^2 .

It is a self number, because there is not a number n which added to its sum of digits gives 53050.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 53050.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 481 + ... + 580.

253050 is an apocalyptic number.

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

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

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

53050 is an evil number, because the sum of its binary digits is even.

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

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

The square root of 53050 is about 230.3258561256. The cubic root of 53050 is about 37.5746660490.

Subtracting from 53050 its product of nonzero digits (75), we obtain a triangular number (52975 = T325).

Adding to 53050 its reverse (5035), we get a palindrome (58085).

The spelling of 53050 in words is "fifty-three thousand, fifty".

Divisors: 1 2 5 10 25 50 1061 2122 5305 10610 26525 53050