Base | Representation |
---|---|
bin | 11101000110110101101… |
… | …101001100100010000100 |
3 | 21002012212221211102112210 |
4 | 131012311231030202010 |
5 | 230232411312112143 |
6 | 4130514421543420 |
7 | 264340012110651 |
oct | 35066555144204 |
9 | 7065787742483 |
10 | 2000208316548 |
11 | 7013134a4122 |
12 | 2837a1874b70 |
13 | 116807770bc0 |
14 | 6cb4c3d8c28 |
15 | 3706b42b033 |
hex | 1d1b5b4c884 |
2000208316548 has 96 divisors (see below), whose sum is σ = 5051978588160. Its totient is φ = 612290125440.
The previous prime is 2000208316453. The next prime is 2000208316619. The reversal of 2000208316548 is 8456138020002.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 94754611 + ... + 94775717.
It is an arithmetic number, because the mean of its divisors is an integer number (52624776960).
Almost surely, 22000208316548 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 2000208316548, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2525989294080).
2000208316548 is an abundant number, since it is smaller than the sum of its proper divisors (3051770271612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000208316548 is a wasteful number, since it uses less digits than its factorization.
2000208316548 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24217 (or 24215 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 39.
The spelling of 2000208316548 in words is "two trillion, two hundred eight million, three hundred sixteen thousand, five hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •