Base | Representation |
---|---|
bin | 11101000110010001111… |
… | …011100100010001000000 |
3 | 21002011100010102110201102 |
4 | 131012101323210101000 |
5 | 230230144133312000 |
6 | 4130335101153532 |
7 | 264316103305103 |
oct | 35062173442100 |
9 | 7064303373642 |
10 | 1999608104000 |
11 | 7010357105a1 |
12 | 28365485b8a8 |
13 | 1167402cc650 |
14 | 6cad27d873a |
15 | 370338ba3d5 |
hex | 1d191ee4440 |
1999608104000 has 448 divisors, whose sum is σ = 5402258813952. Its totient is φ = 728792064000.
The previous prime is 1999608103957. The next prime is 1999608104017. The reversal of 1999608104000 is 4018069991.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4318807769 + ... + 4318808231.
It is an arithmetic number, because the mean of its divisors is an integer number (12058613424).
Almost surely, 21999608104000 is an apocalyptic number.
1999608104000 is a gapful number since it is divisible by the number (10) 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 1999608104000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2701129406976).
1999608104000 is an abundant number, since it is smaller than the sum of its proper divisors (3402650709952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1999608104000 is a wasteful number, since it uses less digits than its factorization.
1999608104000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951 (or 931 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 47.
The spelling of 1999608104000 in words is "one trillion, nine hundred ninety-nine billion, six hundred eight million, one hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •