Base | Representation |
---|---|
bin | 11110010011010100011… |
… | …100001111010000010000 |
3 | 21101001212001011000220000 |
4 | 132103110130033100100 |
5 | 233104102023443233 |
6 | 4232335231050000 |
7 | 303305015610234 |
oct | 36232434172020 |
9 | 7331761130800 |
10 | 2082328343568 |
11 | 733124077950 |
12 | 29769b670900 |
13 | 121493b86375 |
14 | 72adc9545c4 |
15 | 39275abad13 |
hex | 1e4d470f410 |
2082328343568 has 400 divisors, whose sum is σ = 6664026600000. Its totient is φ = 622464860160.
The previous prime is 2082328343471. The next prime is 2082328343587. The reversal of 2082328343568 is 8653438232802.
2082328343568 is a `hidden beast` number, since 2 + 0 + 8 + 2 + 3 + 283 + 4 + 356 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 1477876048 + ... + 1477877456.
It is an arithmetic number, because the mean of its divisors is an integer number (16660066500).
Almost surely, 22082328343568 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 2082328343568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3332013300000).
2082328343568 is an abundant number, since it is smaller than the sum of its proper divisors (4581698256432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2082328343568 is a wasteful number, since it uses less digits than its factorization.
2082328343568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2772 (or 2757 counting only the distinct ones).
The product of its (nonzero) digits is 13271040, while the sum is 54.
The spelling of 2082328343568 in words is "two trillion, eighty-two billion, three hundred twenty-eight million, three hundred forty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •