Base | Representation |
---|---|
bin | 1001101101100… |
… | …01011011000111 |
3 | 12200021221211020 |
4 | 10312301123013 |
5 | 131323421304 |
6 | 12030042223 |
7 | 2006313231 |
oct | 466613307 |
9 | 180257736 |
10 | 81467079 |
11 | 41a93471 |
12 | 23349373 |
13 | 13b55095 |
14 | ab69251 |
15 | 72435d9 |
hex | 4db16c7 |
81467079 has 8 divisors (see below), whose sum is σ = 114339840. Its totient is φ = 51452856.
The previous prime is 81467059. The next prime is 81467093. The reversal of 81467079 is 97076418.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 81467079 - 25 = 81467047 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 81467079.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (81467059) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 714567 + ... + 714680.
It is an arithmetic number, because the mean of its divisors is an integer number (14292480).
Almost surely, 281467079 is an apocalyptic number.
81467079 is a deficient number, since it is larger than the sum of its proper divisors (32872761).
81467079 is a wasteful number, since it uses less digits than its factorization.
81467079 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429269.
The product of its (nonzero) digits is 84672, while the sum is 42.
The square root of 81467079 is about 9025.9115329146. The cubic root of 81467079 is about 433.5049374911.
It can be divided in two parts, 8146 and 7079, that added together give a triangular number (15225 = T174).
The spelling of 81467079 in words is "eighty-one million, four hundred sixty-seven thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •