Special properties of the number $146$

Question

I'm a math teacher. Next week I'll give a special lecture about number theory curiosities. It will treat special properties of numbers — the famous story with Ramanujan, taxicab numbers, later numbers divisible by all their digits, etc.

I was given class number $146$ for the lecture and I think it would be fine to start with a special property of our class's number. Ramanujan would surely find something at once, but I can't. Do you see any special properties of $146$?

Here are some of my observations, but these properties are not very special:

• $146$ is a semiprime number (product of two distinct primes), while the reversal $641$ is prime.

• $146 = 4^3 + 4^3 + 3^2 + 3^2$.

Here is a very similar question, just to show what kind of question this is and what kind of answers I would like to see.

Answer 1

The $146$ is the smallest number that can be expressed as a sum of three squares in exactly five ways:

\begin{align} 146 &= 0^2 + 5^2 + 11^2\\ &= 1^2 + 1^2 + 12^2\\ &= 1^2 + 8^2 + 9^2\\ &= 3^2 + 4^2 + 11^2\\ &= 4^2 + 7^2 + 9^2\\ \end{align}

See https://oeis.org/A294594.

Answer 2

$146$ can be written as squares of two primes: $$146=5^2+11^2=5^2+(1+4+6)^2=(1+4)^2+(1+4+6)^2.$$

Answer 3

The Postmaster General has decided that only three different stamp denominations shall be produced and also that one may stick at most ten stamps on an envelope. Also, it shall be possible to stick stamps of any total value from $1$ cent, $2$ cents, ..., up to $N$ cents (inclusive). Of course, the value of $N$ depends on the three stamp denominations. What is $N$ if the denominations are $1$ cent, $10$ cents, $15$ cents? Who can find a better choice of stamp denominations? What is the best choice of stamp denominations and what is $N$ for that choice?

The answer to the last question id $N=146$.

Answer 4

$$1^1 + 3^4 + 2^6 = 146$$ Note that if you swap the $2$ and $3$ for an even more "pleasing" expression, you have $$1^1 + 2^4 + 3^6 = 746 = 1^7 + 2^4 + 3^6$$ Curiously the "46"ness doesn't change.

Answer 5

Interesting question... Here are a few facts about $146$ I just found...

• $146 = (1^3 - 1) - 4^3 + (6^3 - 6)$
• $(1^2 + 4^2 + 6^2) + (1+4+6) = 4^3$.
• $641 - 146$ is divisible by $1+4+6$
• The sum of the sum of digits of $146^1, 146^4, 146^6$ is $2^7-1$.
• The sum of the product of the digits of $146^2$ and $146^3$ is $12^2$, which is $146 - 2$.
• The digits, with repetition, of $146^2$ are all contained in the digits of $146^3$.
• $\underbrace{\color{blue}{11^2 + 44^2 + 66^2}}_{\color{red}{3\text{ terms}}} = \color{blue}{641}\color{red}{3}$

Answer 6

$$(222)_8=(146)_{10}$$ $$=2\cdot8^2+2\cdot8^1+2\cdot8^0$$ $$=2\cdot64+2\cdot8+2\cdot1$$ $$=128+16+2=146$$ This is the decimal equivalent of the octal number $222$

Answer 7

Whichever properties you choose to illustrate, in the end you can conclude by a reflexion on how likely it is that one will find "amazing" properties of any given number, as the human mind is craving for entertainment and amazement and will consider any kind of property mixing up elementary operations and digit breaking as acceptable.

Then ask your students which of the previously discussed properties they feel are actually, mathematically, interesting.

Answer 8

146 in base 7,13,19,31...$p \equiv 1 \pmod 6$ Is prime for the first few primes

http://oeis.org/A056899

Answer 9

Two nice facts about sums of cubes:

1. We can write $146$ as $$4 \cdot 1^3 + 3 \cdot 2^3 +2 \cdot 3^3 + 1 \cdot 4^3.$$ The previous term in this sequence is $$3 \cdot 1^3 + 2 \cdot 2^3 + 1 \cdot 3^3 = 46.$$
2. $146$ is the second-largest integer that can't be written as the sum of cubes bigger than $1$. (The largest is $154$.)

Also, http://oeis.org/A134907 gives us a really weird formula for $146$: $$146 = \left\lfloor 5 e^{-\tan 5}\right\rfloor.$$

From http://oeis.org/A172877, we see that there are exactly $146$ $4 \times 2$ matrices such as $$\begin{bmatrix}1 & 4 \\ 2 & 3 \\ 3 & 2 \\ 4 & 1\end{bmatrix}$$ with nonnegative integer entries in which each row sums to $5$ and each column sums to $10$.

Answer 10

146 is the hypotenuse of a Pythagorean triple.

Answer 11

I am surprised how this has not been included in the answers so far and interesting story about 641 from the history and pioneers of number theory.

Fermat conjectured that all numbers of the form $2^{2^n}+1$ are primes and this conjectures was found to be true for $n = 1,2,3$. For $n = 5$, $2^{2^5}+1 = 4294967297$ was too big for him to check if it was a prime. A century later, Euler proved that $2^{2^5}+1$ is divisible by 641. In fact we have a much stronger result.

641 divides all the Generalised Fermat numbers of the form $$ (2^a*5^b)^{2^5} + 1 $$

where $a$ is odd and $b$ is even, or a is even and b is odd.

Answer 12

Representations in digits $1,...,9$, ascending and descending, using only plus and minus signs:

$$123+45+67-89=146$$

$$-98-76-5+4+321=146$$

And also, with the digits not in sequence but using only multiplication, division and exponentiation:

$$\frac{876 \times 3 \times 9^{1/2}}{54}=146$$

Answer 13

Other than $1$, $10$ and $100$ which may be considered trivial cases, $146$ is the smallest positive integer $n$ such that, ignoring sequence and repetitions, $n^2$ and $n^3$ contain exactly the same digits:

$$146^2 = 21316$$

$$146^3 = 3112136$$

This is readily verified by reviewing the values of $n^2$ and $n^3$ for $n = 2,3,...,145$.

Addendum 11 June 2018

In fact this is the only non-trivial case of a positive integer with this property for $n < 1000$.

Answer 14

Here is a number pyramid: $$\begin{align}35^1+36^1+37^1+38^1=&146\\ 35^3+36^3+37^3+38^3=&146\cdot 1336 \\ 35^5+36^5+37^5+38^5=&146\cdot 1791556 \\ 35^7+36^7+37^7+38^7=&146\cdot 2411307676 \\ \vdots \\ 35^{2n+1}+36^{2n+1}+37^{2n+1}+38^{2n+1}=&146\cdot f(2n+1)\end{align}$$ Exercise: Find a) $f(9)$; b) $f(2n+1)$.

Answer 15

A reasonably simple pattern is $$1^4+4\times2^4+3^4=146$$

Also I found that $$\sum_{k=1^2}^{2^2}k+\sum_{k=1^2}^{4^2}k=146$$ and that by adding $1$ to all the exponents we have $$\sum_{k=1^3}^{2^3}k^2+\sum_{k=1^3}^{4^3}k^2=146\times614$$ which is a multiple of 146; with the multiplier $614$ being a rearrangement of $146$.

With $\frac{614}{146}=\frac{307}{073}$; the numerator $307$ being a rearrangement of $073$ (the largest prime factor of $146$), itself being the largest prime factor of $614$.

Answer 16

Inspired by a comment by DanielBuck:

$$1!+4!+(6-1)!=146-1$$

Answer 17

My first thought was to look at Erich Friedman's What's Special About This Number? There I find that 146 is 222 in octal. I'm sorry, I don't find that all that special.

My second thought was to look in the OEIS. I ran the search 146 keyword:nice. This gave me 211 results. I only looked at the first ten.

Aside from the ones that have already been mentioned here, the most interesting one, in my opinion, is A003714, the Fibbinary numbers. In binary, 146 is 10010010, which you could have already figured out from the octal representation.

In Fibonacci base (Zeckendorf), 146 is 10000000010 (I hope I have the right number of zeroes there). Also no consecutive ones.

Answer 18

Expanding on lulu's comment, the $146$ is the smallest Untouchable Semiprime - see https://oeis.org/A119379.

Untouchable number - Number that cannot be expressed as the sum of all the proper divisors of any positive integer (including itself).

Semiprime - Number that is the product of two primes.

Answer 19

The sum of the first $n$ cubes, starting from $1^3$, is given by the square of the $n$th Triangular number, $T_n$:

\begin{align} 1^3 &= & 1^2 &= & T_{1}^2\\ 1^3+2^3 &= & 3^2 &= & T_{2}^2 \\ 1^3+2^3+3^3 &= & 6^2 &= & T_{3}^2 \\ 1^3+2^3+3^3+4^3 &= & 10^2 &= & T_{4}^2 \\ \end{align}

Noting this we can write the sum of the first $n$ squares of the Triangular numbers as: \begin{align*} \sum_{i=1}^{n}T_i^2&=T_1^2+T_2^2+\dotsb+T_n^2\tag{1}\\ &=n\times1^3+(n-1)\times2^3+\dotsb+1\times n^3\\ &=\sum_{k=1}^{n}(n-k+1)k^3\tag{2} \end{align*} Note, taking $n=4$ in $(1)$ gives $$T_{1}^2+T_{2}^2+T_{3}^2+T_{4}^2=1^2+3^2+6^2+10^2=146$$ and taking $n=4$ in $(2)$ gives $$4\times1^3+3\times2^3+2\times 3^3+1\times 4^3=146$$

As a consequence of $(1)$ another nice pattern emerges: $$\frac{1}{4}\left[2^2(1^2+3^2)+4^2(3^2+5^2)\right]=146$$