Base | Representation |
---|---|
bin | 1001110110101… |
… | …11000111001111 |
3 | 12202120001222000 |
4 | 10323113013033 |
5 | 132130420111 |
6 | 12111523343 |
7 | 2022453333 |
oct | 473270717 |
9 | 182501860 |
10 | 82670031 |
11 | 42735244 |
12 | 23829553 |
13 | 141867a2 |
14 | ad9d7c3 |
15 | 73cec56 |
hex | 4ed71cf |
82670031 has 32 divisors (see below), whose sum is σ = 130403520. Its totient is φ = 51581952.
The previous prime is 82670023. The next prime is 82670041. The reversal of 82670031 is 13007628.
It is not a de Polignac number, because 82670031 - 23 = 82670023 is a prime.
It is a super-2 number, since 2×826700312 = 13668668051081922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 82669977 and 82670004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82670041) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 106561 + ... + 107333.
It is an arithmetic number, because the mean of its divisors is an integer number (4075110).
Almost surely, 282670031 is an apocalyptic number.
82670031 is a deficient number, since it is larger than the sum of its proper divisors (47733489).
82670031 is a wasteful number, since it uses less digits than its factorization.
82670031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1032 (or 1026 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 82670031 is about 9092.3061431080. The cubic root of 82670031 is about 435.6282479841.
Adding to 82670031 its reverse (13007628), we get a palindrome (95677659).
The spelling of 82670031 in words is "eighty-two million, six hundred seventy thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •