Search a number
-
+
44714985216 = 28311172313537
BaseRepresentation
bin101001101001001110…
…001000011100000000
311021102021010121021120
4221221032020130000
51213034014011331
632313005152240
73142036050246
oct515116103400
9137367117246
1044714985216
1117a66497240
1287bab5b680
1342a7b5c045
14224287a796
15126a8de796
hexa69388700

44714985216 has 288 divisors, whose sum is σ = 143449947648. Its totient is φ = 12197560320.

The previous prime is 44714985197. The next prime is 44714985223. The reversal of 44714985216 is 61258941744.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3296400 + ... + 3309936.

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

Almost surely, 244714985216 is an apocalyptic number.

44714985216 is a gapful number since it is divisible by the number (46) 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 44714985216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71724973824).

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

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

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

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

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

The product of its digits is 1935360, while the sum is 51.

The spelling of 44714985216 in words is "forty-four billion, seven hundred fourteen million, nine hundred eighty-five thousand, two hundred sixteen".