Base | Representation |
---|---|
bin | 100100011110011000011… |
… | …0000010011111000000000 |
3 | 122202020112201012212221120 |
4 | 1020330300300103320000 |
5 | 1124113203432230440 |
6 | 14354543323552240 |
7 | 1025115631530012 |
oct | 110746060237000 |
9 | 18666481185846 |
10 | 5013044805120 |
11 | 1663025114740 |
12 | 68b68a68b680 |
13 | 2a4960822971 |
14 | 1348c00561b2 |
15 | 8a602a73dd0 |
hex | 48f30c13e00 |
5013044805120 has 320 divisors, whose sum is σ = 17812877474304. Its totient is φ = 1192352645120.
The previous prime is 5013044805079. The next prime is 5013044805121. The reversal of 5013044805120 is 215084403105.
It is a tau number, because it is divible by the number of its divisors (320).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5013044805121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3917629 + ... + 5037251.
Almost surely, 25013044805120 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 5013044805120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8906438737152).
5013044805120 is an abundant number, since it is smaller than the sum of its proper divisors (12799832669184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5013044805120 is a wasteful number, since it uses less digits than its factorization.
5013044805120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1119713 (or 1119697 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 33.
The spelling of 5013044805120 in words is "five trillion, thirteen billion, forty-four million, eight hundred five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •