[go: up one dir, main page]

Search a number
-
+
53099200 = 2652711431
BaseRepresentation
bin1100101010001…
…1101011000000
310200220201102001
43022203223000
5102043133300
65134033344
71213223110
oct312435300
9120821361
1053099200
1127a78240
1215948854
13b001c5b
1470a3040
1549dd16a
hex32a3ac0

53099200 has 168 divisors, whose sum is σ = 163275264. Its totient is φ = 16512000.

The previous prime is 53099197. The next prime is 53099201. The reversal of 53099200 is 299035.

It is a Harshad number since it is a multiple of its sum of digits (28).

It is not an unprimeable number, because it can be changed into a prime (53099201) 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 23 ways as a sum of consecutive naturals, for example, 122985 + ... + 123415.

Almost surely, 253099200 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 53099200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81637632).

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

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

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

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

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

The product of its (nonzero) digits is 2430, while the sum is 28.

The square root of 53099200 is about 7286.9197882233. The cubic root of 53099200 is about 375.8627837923.

The spelling of 53099200 in words is "fifty-three million, ninety-nine thousand, two hundred".