Base | Representation |
---|---|
bin | 111110000100011… |
… | …1000111000100100 |
3 | 12101010222101001201 |
4 | 1330020320320210 |
5 | 13231133024212 |
6 | 542355332244 |
7 | 102416462020 |
oct | 17410707044 |
9 | 5333871051 |
10 | 2082704932 |
11 | 9796a6050 |
12 | 4a15b1084 |
13 | 2726439a9 |
14 | 15a867380 |
15 | c2c9cb57 |
hex | 7c238e24 |
2082704932 has 48 divisors (see below), whose sum is σ = 4564611072. Its totient is φ = 807778080.
The previous prime is 2082704903. The next prime is 2082704959. The reversal of 2082704932 is 2394072802.
It is a junction number, because it is equal to n+sod(n) for n = 2082704891 and 2082704900.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53523 + ... + 83845.
It is an arithmetic number, because the mean of its divisors is an integer number (95096064).
Almost surely, 22082704932 is an apocalyptic number.
2082704932 is a gapful number since it is divisible by the number (22) 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 2082704932, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2282305536).
2082704932 is an abundant number, since it is smaller than the sum of its proper divisors (2481906140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2082704932 is a wasteful number, since it uses less digits than its factorization.
2082704932 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30568 (or 30566 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 37.
The square root of 2082704932 is about 45636.6621478828. The cubic root of 2082704932 is about 1277.0539611108.
The spelling of 2082704932 in words is "two billion, eighty-two million, seven hundred four thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •