Base | Representation |
---|---|
bin | 100011010110101000010… |
… | …1000011110100100000000 |
3 | 122012111211022222102021010 |
4 | 1012231100220132210000 |
5 | 1114102122431100000 |
6 | 14200101545000520 |
7 | 1011022402225206 |
oct | 106552050364400 |
9 | 18174738872233 |
10 | 4858960800000 |
11 | 160374577604a |
12 | 665848183140 |
13 | 29327611b738 |
14 | 12b264125076 |
15 | 865d5678d50 |
hex | 46b50a1e900 |
4858960800000 has 216 divisors, whose sum is σ = 16163875570752. Its totient is φ = 1295722240000.
The previous prime is 4858960799999. The next prime is 4858960800019. The reversal of 4858960800000 is 80698584.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1387717 + ... + 3412283.
It is an arithmetic number, because the mean of its divisors is an integer number (74832757272).
Almost surely, 24858960800000 is an apocalyptic number.
4858960800000 is a gapful number since it is divisible by the number (40) 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 4858960800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8081937785376).
4858960800000 is an abundant number, since it is smaller than the sum of its proper divisors (11304914770752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4858960800000 is an frugal number, since it uses more digits than its factorization.
4858960800000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2024611 (or 2024577 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 48.
The spelling of 4858960800000 in words is "four trillion, eight hundred fifty-eight billion, nine hundred sixty million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •