1729: Difference between revisions
(→Names) |
|||
| Line 19: | Line 19: | ||
|- | |- | ||
| [[Poulet number]] ([[Fermat pseudoprime]] to base 2) || sixth among them || [[341]], [[561]], [[645]], [[1105]], [[1387]], [[1729]], [[1905]], [[2047]] | | [[Poulet number]] ([[Fermat pseudoprime]] to base 2) || sixth among them || [[341]], [[561]], [[645]], [[1105]], [[1387]], [[1729]], [[1905]], [[2047]] | ||
|} | |||
==Arithmetic functions== | |||
{| class="sortable" border="1" | |||
! Function !! Value !! Similar numbers !! Explanation | |||
|- | |||
| {{arithmetic function value|Euler totient function|1296}} || It is the product <math>(7 - 1)(13 - 1)(19 - 1) = (6)(12)(18) = 1296</math>. | |||
|- | |||
| {{arithmetic function value|universal exponent|36}} || It is the [[least common multiple]] of <math>\{7 - 1, 13 - 1, 19 - 1\}</math>. | |||
|- | |||
| {{arithmetic function value|divisor count function|8}} || It is the product <math>(1 + 1)(1 + 1)(1 + 1)</math> where the first 1s in each sum represent the multiplicities of the prime divisors. | |||
|- | |||
| {{arithmetic function value|divisor sum function|2240}} || It is the product of <math>(7^2 - 1)/(7 - 1)</math>, <math>(13^2 - 1)/(13 - 1)</math>, and <math>(19^2 - 1)/(19 - 1)</math> | |||
|- | |||
| {{arithmetic function value|largest prime divisor|19}} || direct from factorization | |||
|- | |||
| {{arithmetic function value|largest prime power divisor|19}} || direct from factorization | |||
|- | |||
| {{arithmetic function value|square-free part|1729}} || the original number is a [[square-free number]]. | |||
|- | |||
| {{arithmetic function value|Mobius function|-1}} || the number is square-free and has an odd number of prime divisors (namely, 3 prime divisors). | |||
|} | |} | ||
Revision as of 20:38, 2 January 2012
This article is about a particular natural number.|View all articles on particular natural numbers
Summary
Names
This number is called the Hardy-Ramanujan number after a conversation between Hardy and Ramanujan where Ramanujan observed that it is the smallest number expressible as the sum of two cubes in two distinct ways: .
Factorization
Properties and families
| Property or family | Parameter values | First few numbers |
|---|---|---|
| Carmichael number | third among them | 561, 1105, 1729, ... |
| Poulet number (Fermat pseudoprime to base 2) | sixth among them | 341, 561, 645, 1105, 1387, 1729, 1905, 2047 |
Arithmetic functions
| Function | Value | Similar numbers | Explanation |
|---|---|---|---|
| Euler totient function | 1296 | It is the product . | |
| universal exponent | 36 | It is the least common multiple of . | |
| divisor count function | 8 | It is the product where the first 1s in each sum represent the multiplicities of the prime divisors. | |
| divisor sum function | 2240 | It is the product of , , and | |
| largest prime divisor | 19 | direct from factorization | |
| largest prime power divisor | 19 | direct from factorization | |
| square-free part | 1729 | the original number is a square-free number. | |
| Mobius function | -1 | the number is square-free and has an odd number of prime divisors (namely, 3 prime divisors). |