Base | Representation |
---|---|
bin | 1001111001001100… |
… | …11001000000100000 |
3 | 111201011211111102020 |
4 | 10330212121000200 |
5 | 41334241223120 |
6 | 2235023221440 |
7 | 245425254225 |
oct | 47446310040 |
9 | 14634744366 |
10 | 5311664160 |
11 | 22863289a0 |
12 | 1042a47880 |
13 | 6685b185a |
14 | 38562d94c |
15 | 2114bb640 |
hex | 13c999020 |
5311664160 has 384 divisors, whose sum is σ = 19229736960. Its totient is φ = 1219891200.
The previous prime is 5311664143. The next prime is 5311664173. The reversal of 5311664160 is 614661135.
It is a super-2 number, since 2×53116641602 = 56427552297257011200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23194926 + ... + 23195154.
It is an arithmetic number, because the mean of its divisors is an integer number (50077440).
Almost surely, 25311664160 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 5311664160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9614868480).
5311664160 is an abundant number, since it is smaller than the sum of its proper divisors (13918072800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5311664160 is a wasteful number, since it uses less digits than its factorization.
5311664160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472 (or 464 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 5311664160 is about 72881.1646449204. The cubic root of 5311664160 is about 1744.7914967775.
The spelling of 5311664160 in words is "five billion, three hundred eleven million, six hundred sixty-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •