Search a number
-
+
53010922 = 2149177889
BaseRepresentation
bin1100101000111…
…0000111101010
310200202020022111
43022032013222
5102032322142
65132112534
71212404536
oct312160752
9120666274
1053010922
1127a17988
121590574a
13aca0a13
14707cbc6
1549c1e17
hex328e1ea

53010922 has 8 divisors (see below), whose sum is σ = 80050500. Its totient is φ = 26327424.

The previous prime is 53010911. The next prime is 53010953. The reversal of 53010922 is 22901035.

53010922 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 49126081 + 3884841 = 7009^2 + 1971^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 = 53010893 and 53010902.

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

Almost surely, 253010922 is an apocalyptic number.

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

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

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

The sum of its prime factors is 178040.

The product of its (nonzero) digits is 540, while the sum is 22.

The square root of 53010922 is about 7280.8599766786. The cubic root of 53010922 is about 375.6543762618.

Adding to 53010922 its reverse (22901035), we get a palindrome (75911957).

The spelling of 53010922 in words is "fifty-three million, ten thousand, nine hundred twenty-two".

Divisors: 1 2 149 298 177889 355778 26505461 53010922