Base | Representation |
---|---|
bin | 1001110001111… |
… | …11011110100100 |
3 | 12201101111222100 |
4 | 10320333132210 |
5 | 132001031212 |
6 | 12050332100 |
7 | 2014255500 |
oct | 470773644 |
9 | 181344870 |
10 | 82048932 |
11 | 42350639 |
12 | 2358a030 |
13 | 13cc9b84 |
14 | ac7b300 |
15 | 730abdc |
hex | 4e3f7a4 |
82048932 has 108 divisors (see below), whose sum is σ = 243519276. Its totient is φ = 23224320.
The previous prime is 82048931. The next prime is 82048933. The reversal of 82048932 is 23984028.
It is an interprime number because it is at equal distance from previous prime (82048931) and next prime (82048933).
It can be written as a sum of positive squares in 2 ways, for example, as 40755456 + 41293476 = 6384^2 + 6426^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (82048931) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 340332 + ... + 340572.
Almost surely, 282048932 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 82048932, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121759638).
82048932 is an abundant number, since it is smaller than the sum of its proper divisors (161470344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82048932 is a wasteful number, since it uses less digits than its factorization.
82048932 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458 (or 446 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 82048932 is about 9058.0865529095. The cubic root of 82048932 is about 434.5345477219.
The spelling of 82048932 in words is "eighty-two million, forty-eight thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •