Base | Representation |
---|---|
bin | 11110010010101011100… |
… | …001011010010010000000 |
3 | 21101000002012100201020220 |
4 | 132102223201122102000 |
5 | 233101200302133400 |
6 | 4232143144503040 |
7 | 303252011432400 |
oct | 36225341322200 |
9 | 7330065321226 |
10 | 2081641833600 |
11 | 73290160183a |
12 | 29752977aa80 |
13 | 1213b488b254 |
14 | 72a756cc800 |
15 | 392356b07a0 |
hex | 1e4ab85a480 |
2081641833600 has 576 divisors, whose sum is σ = 8161384825440. Its totient is φ = 464734126080.
The previous prime is 2081641833539. The next prime is 2081641833619. The reversal of 2081641833600 is 63381461802.
It is a Harshad number since it is a multiple of its sum of digits (42).
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 71 ways as a sum of consecutive naturals, for example, 20175744 + ... + 20278656.
Almost surely, 22081641833600 is an apocalyptic number.
2081641833600 is a gapful number since it is divisible by the number (20) 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 2081641833600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4080692412720).
2081641833600 is an abundant number, since it is smaller than the sum of its proper divisors (6079742991840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2081641833600 is a wasteful number, since it uses less digits than its factorization.
2081641833600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102997 (or 102973 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 42.
The spelling of 2081641833600 in words is "two trillion, eighty-one billion, six hundred forty-one million, eight hundred thirty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •