Base | Representation |
---|---|
bin | 100101010111001010001… |
… | …1010111011000110000000 |
3 | 200011220021022021120221020 |
4 | 1022232110122323012000 |
5 | 1133112412324120410 |
6 | 14530550404425440 |
7 | 1036663330604160 |
oct | 112562432730600 |
9 | 20156238246836 |
10 | 5134976004480 |
11 | 16aa8050a4493 |
12 | 6ab2390a8280 |
13 | 2b32c2b4573a |
14 | 13a769a685a0 |
15 | 8d88c34ba70 |
hex | 4ab946bb180 |
5134976004480 has 512 divisors, whose sum is σ = 18841061376000. Its totient is φ = 1165260349440.
The previous prime is 5134976004451. The next prime is 5134976004497. The reversal of 5134976004480 is 844006794315.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1398793045 + ... + 1398796715.
It is an arithmetic number, because the mean of its divisors is an integer number (36798948000).
Almost surely, 25134976004480 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 5134976004480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9420530688000).
5134976004480 is an abundant number, since it is smaller than the sum of its proper divisors (13706085371520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5134976004480 is a wasteful number, since it uses less digits than its factorization.
5134976004480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4422 (or 4410 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 51.
The spelling of 5134976004480 in words is "five trillion, one hundred thirty-four billion, nine hundred seventy-six million, four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •