Search a number
-
+
53025100 = 2252530251
BaseRepresentation
bin1100101001000…
…1100101001100
310200202221202121
43022101211030
5102033300400
65132302324
71212464062
oct312214514
9120687677
1053025100
1127a275a7
12159119a4
13aca72cb
147084032
1549c621a
hex329194c

53025100 has 18 divisors (see below), whose sum is σ = 115064684. Its totient is φ = 21210000.

The previous prime is 53025059. The next prime is 53025103. The reversal of 53025100 is 152035.

It is a super-2 number, since 2×530251002 = 5623322460020000, which contains 22 as substring.

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

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

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

Almost surely, 253025100 is an apocalyptic number.

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

It is an amenable number.

53025100 is an abundant number, since it is smaller than the sum of its proper divisors (62039584).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 150, while the sum is 16.

The square root of 53025100 is about 7281.8335603061. The cubic root of 53025100 is about 375.6878634049.

Adding to 53025100 its reverse (152035), we get a palindrome (53177135).

The spelling of 53025100 in words is "fifty-three million, twenty-five thousand, one hundred".

Divisors: 1 2 4 5 10 20 25 50 100 530251 1060502 2121004 2651255 5302510 10605020 13256275 26512550 53025100