Search a number
-
+
53050405650 = 23521153653929
BaseRepresentation
bin110001011010000011…
…001111001100010010
312001221011200211111220
4301122003033030102
51332121400440100
640212050145510
73555432002454
oct613203171422
9161834624456
1053050405650
1120553630a60
12a346582296
135005a22198
1427d38d82d4
1515a7593aa0
hexc5a0cf312

53050405650 has 192 divisors, whose sum is σ = 146615080320. Its totient is φ = 12585164800.

The previous prime is 53050405643. The next prime is 53050405651. The reversal of 53050405650 is 5650405035.

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

It is a Curzon number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 57104386 + ... + 57105314.

It is an arithmetic number, because the mean of its divisors is an integer number (763620210).

Almost surely, 253050405650 is an apocalyptic number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 45000, while the sum is 33.

The spelling of 53050405650 in words is "fifty-three billion, fifty million, four hundred five thousand, six hundred fifty".