Search a number
-
+
55919560950 = 235521171283
BaseRepresentation
bin110100000101000100…
…001100100011110110
312100100010112000200000
4310011010030203312
51404010401422300
641404502132130
74016511265641
oct640504144366
9170303460600
1055919560950
1121796152890
12aa07421046
135372283606
1429c69a0a58
1516c43ddc00
hexd0510c8f6

55919560950 has 432 divisors, whose sum is σ = 174469958208. Its totient is φ = 13204296000.

The previous prime is 55919560913. The next prime is 55919560951. The reversal of 55919560950 is 5906591955.

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

It is a congruent number.

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

It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 673729609 + ... + 673729691.

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

Almost surely, 255919560950 is an apocalyptic number.

55919560950 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 55919560950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87234979104).

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

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

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

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

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

The product of its (nonzero) digits is 2733750, while the sum is 54.

The spelling of 55919560950 in words is "fifty-five billion, nine hundred nineteen million, five hundred sixty thousand, nine hundred fifty".