Base | Representation |
---|---|
bin | 1001100010000000… |
… | …01100110100000000 |
3 | 111012121201210011200 |
4 | 10301000030310000 |
5 | 40434434301420 |
6 | 2203433141200 |
7 | 240543442455 |
oct | 46100146400 |
9 | 14177653150 |
10 | 5117103360 |
11 | 2196520546 |
12 | ba985a800 |
13 | 6371b0215 |
14 | 36786582c |
15 | 1ee388b90 |
hex | 13100cd00 |
5117103360 has 648 divisors, whose sum is σ = 19822977720. Its totient is φ = 1216610304.
The previous prime is 5117103281. The next prime is 5117103391. The reversal of 5117103360 is 633017115.
It can be written as a sum of positive squares in 12 ways, for example, as 8856576 + 5108246784 = 2976^2 + 71472^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 96549094 + ... + 96549146.
It is an arithmetic number, because the mean of its divisors is an integer number (30591015).
Almost surely, 25117103360 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 5117103360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9911488860).
5117103360 is an abundant number, since it is smaller than the sum of its proper divisors (14705874360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5117103360 is a wasteful number, since it uses less digits than its factorization.
5117103360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143 (or 109 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 5117103360 is about 71533.9315290303. The cubic root of 5117103360 is about 1723.2226583303. Note that the first 3 decimals are identical.
The spelling of 5117103360 in words is "five billion, one hundred seventeen million, one hundred three thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •