Base | Representation |
---|---|
bin | 1001100111100110… |
… | …01010000110000000 |
3 | 111022220000012012212 |
4 | 10303303022012000 |
5 | 41033442003000 |
6 | 2212230441252 |
7 | 241653261143 |
oct | 46363120600 |
9 | 14286005185 |
10 | 5164016000 |
11 | 220aa52720 |
12 | 1001503228 |
13 | 643b27290 |
14 | 36db9805a |
15 | 203553c35 |
hex | 133cca180 |
5164016000 has 512 divisors, whose sum is σ = 15745242240. Its totient is φ = 1658880000.
The previous prime is 5164015979. The next prime is 5164016027. The reversal of 5164016000 is 6104615.
It is a super-2 number, since 2×51640160002 = 53334122496512000000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 84655970 + ... + 84656030.
Almost surely, 25164016000 is an apocalyptic number.
5164016000 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 5164016000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7872621120).
5164016000 is an abundant number, since it is smaller than the sum of its proper divisors (10581226240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5164016000 is a wasteful number, since it uses less digits than its factorization.
5164016000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151 (or 129 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 5164016000 is about 71861.0882188685. The cubic root of 5164016000 is about 1728.4727073240.
The spelling of 5164016000 in words is "five billion, one hundred sixty-four million, sixteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •