Base | Representation |
---|---|
bin | 1001101000001100… |
… | …10000110000000000 |
3 | 111100020102121220100 |
4 | 10310012100300000 |
5 | 41041232232000 |
6 | 2212530042400 |
7 | 242043656550 |
oct | 46406206000 |
9 | 14306377810 |
10 | 5169024000 |
11 | 2212863268 |
12 | 1003119400 |
13 | 644b8b8aa |
14 | 3706dd160 |
15 | 203be2a00 |
hex | 134190c00 |
5169024000 has 528 divisors, whose sum is σ = 21321158976. Its totient is φ = 1179648000.
The previous prime is 5169023989. The next prime is 5169024011. The reversal of 5169024000 is 4209615.
It is an interprime number because it is at equal distance from previous prime (5169023989) and next prime (5169024011).
It is a super-2 number, since 2×51690240002 = 53437618225152000000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8063680 + ... + 8064320.
Almost surely, 25169024000 is an apocalyptic number.
5169024000 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 5169024000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10660579488).
5169024000 is an abundant number, since it is smaller than the sum of its proper divisors (16152134976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5169024000 is a wasteful number, since it uses less digits than its factorization.
5169024000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689 (or 658 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 5169024000 is about 71895.9247801988. The cubic root of 5169024000 is about 1729.0312774111.
The spelling of 5169024000 in words is "five billion, one hundred sixty-nine million, twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •