Base | Representation |
---|---|
bin | 100100001111011001001… |
… | …1100000100110000000000 |
3 | 122122011110202100000202221 |
4 | 1020132302130010300000 |
5 | 1123101300331100000 |
6 | 14332101553020424 |
7 | 1022566242150211 |
oct | 110366234046000 |
9 | 18564422300687 |
10 | 4980860800000 |
11 | 165040a0862a8 |
12 | 6853a8254714 |
13 | 2a1901b39657 |
14 | 133109935408 |
15 | 8986c33c61a |
hex | 487b2704c00 |
4980860800000 has 132 divisors (see below), whose sum is σ = 12445283294640. Its totient is φ = 1992343040000.
The previous prime is 4980860799973. The next prime is 4980860800009. The reversal of 4980860800000 is 80680894.
It is a self number, because there is not a number n which added to its sum of digits gives 4980860800000.
It is not an unprimeable number, because it can be changed into a prime (4980860800009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2421741 + ... + 3978259.
Almost surely, 24980860800000 is an apocalyptic number.
4980860800000 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 4980860800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6222641647320).
4980860800000 is an abundant number, since it is smaller than the sum of its proper divisors (7464422494640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4980860800000 is an frugal number, since it uses more digits than its factorization.
4980860800000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1556564 (or 1556526 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 43.
The spelling of 4980860800000 in words is "four trillion, nine hundred eighty billion, eight hundred sixty million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •