Search a number
-
+
53050100 = 2252530501
BaseRepresentation
bin1100101001011…
…1101011110100
310200211020001112
43022113223310
5102040100400
65133014152
71212630005
oct312275364
9120736045
1053050100
1127a44364
1215924358
13acb57bc
14708d1ac
1549cd835
hex3297af4

53050100 has 18 divisors (see below), whose sum is σ = 115118934. Its totient is φ = 21220000.

The previous prime is 53050097. The next prime is 53050111. The reversal of 53050100 is 105035.

It can be written as a sum of positive squares in 3 ways, for example, as 574564 + 52475536 = 758^2 + 7244^2 .

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 253050100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The square root of 53050100 is about 7283.5499586397. The cubic root of 53050100 is about 375.7468965855.

Adding to 53050100 its reverse (105035), we get a palindrome (53155135).

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

Divisors: 1 2 4 5 10 20 25 50 100 530501 1061002 2122004 2652505 5305010 10610020 13262525 26525050 53050100