Search a number
-
+
5100919691920 = 245132329163197229
BaseRepresentation
bin100101000111010011010…
…0000011001101010010000
3200001122100212022122210121
41022032212200121222100
51132033140420120140
614503155151440024
71034346354663163
oct112164640315220
920048325278717
105100919691920
111697319204828
126a4713826014
132b00262a34c0
14138c58a0bada
158ca4757764a
hex4a3a6819a90

5100919691920 has 640 divisors, whose sum is σ = 14002653772800. Its totient is φ = 1712449880064.

The previous prime is 5100919691869. The next prime is 5100919691939. The reversal of 5100919691920 is 291969190015.

It is a happy number.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 22274758366 + ... + 22274758594.

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

Almost surely, 25100919691920 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 393660, while the sum is 52.

The spelling of 5100919691920 in words is "five trillion, one hundred billion, nine hundred nineteen million, six hundred ninety-one thousand, nine hundred twenty".