Search a number
-
+
61556064150 = 235271719181501
BaseRepresentation
bin111001010101000001…
…101111111110010110
312212212221121001110210
4321111001233332112
52002031323023100
644140052030250
74306262624610
oct712501577626
9185787531423
1061556064150
1124118880099
12bb1b002386
135a5cc4bac9
142d9d3cbdb0
151904173c50
hexe5506ff96

61556064150 has 192 divisors, whose sum is σ = 194453982720. Its totient is φ = 12545280000.

The previous prime is 61556064127. The next prime is 61556064217. The reversal of 61556064150 is 5146065516.

It is a junction number, because it is equal to n+sod(n) for n = 61556064099 and 61556064108.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 261556064150 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 108000, while the sum is 39.

The spelling of 61556064150 in words is "sixty-one billion, five hundred fifty-six million, sixty-four thousand, one hundred fifty".