Base | Representation |
---|---|
bin | 1001110001111… |
… | …10001001010001 |
3 | 12201101020111011 |
4 | 10320332021101 |
5 | 132000342343 |
6 | 12050250521 |
7 | 2014233541 |
oct | 470761121 |
9 | 181336434 |
10 | 82043473 |
11 | 42347526 |
12 | 23586a41 |
13 | 13cc7545 |
14 | ac79321 |
15 | 730929d |
hex | 4e3e251 |
82043473 has 4 divisors (see below), whose sum is σ = 82889380. Its totient is φ = 81197568.
The previous prime is 82043449. The next prime is 82043483. The reversal of 82043473 is 37434028.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15000129 + 67043344 = 3873^2 + 8188^2 .
It is a cyclic number.
It is not a de Polignac number, because 82043473 - 213 = 82035281 is a prime.
It is a super-2 number, since 2×820434732 = 13462262923803458, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (82043413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 422808 + ... + 423001.
It is an arithmetic number, because the mean of its divisors is an integer number (20722345).
Almost surely, 282043473 is an apocalyptic number.
It is an amenable number.
82043473 is a deficient number, since it is larger than the sum of its proper divisors (845907).
82043473 is an equidigital number, since it uses as much as digits as its factorization.
82043473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845906.
The product of its (nonzero) digits is 16128, while the sum is 31.
The square root of 82043473 is about 9057.7852149408. The cubic root of 82043473 is about 434.5249104780.
The spelling of 82043473 in words is "eighty-two million, forty-three thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •