Search a number
-
+
5105015520000 = 28354113131189
BaseRepresentation
bin100101001001001101010…
…1000101111101100000000
3200002000221022100021122220
41022102122220233230000
51132120032433120000
614505113423331040
71034553020645004
oct112223250575400
920060838307586
105105015520000
1116990301a0010
126a5477450a80
132b0529a07806
14139126988704
158cbd6e2b1a0
hex4a49aa2fb00

5105015520000 has 720 divisors, whose sum is σ = 19119587773440. Its totient is φ = 1197619200000.

The previous prime is 5105015519987. The next prime is 5105015520041. The reversal of 5105015520000 is 255105015.

It is a super-2 number, since 2×51050155200002 (a number of 26 digits) contains 22 as substring.

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

It is an unprimeable number.

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 163664406 + ... + 163695594.

Almost surely, 25105015520000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1250, while the sum is 24.

The spelling of 5105015520000 in words is "five trillion, one hundred five billion, fifteen million, five hundred twenty thousand".