252 (number): Difference between revisions
Content deleted Content added
No edit summary Tags: Mobile edit Mobile web edit |
Undid revision 1127014637 by Dhrm77 (talk) The explanation is that these number articles are the TV Tropes of wikimath. People keep adding unsourced junk properties to them and the weeds need to be trimmed or it will become all weeds. |
||
| (21 intermediate revisions by 15 users not shown) | |||
| Line 2: | Line 2: | ||
| number = 252 |
| number = 252 |
||
| divisor = 1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 63, 84, 126, 252 |
| divisor = 1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 63, 84, 126, 252 |
||
}} |
|||
}} 44 dismil jamin |
|||
'''252''' ('''two hundred [and] fifty-two''') is the [[natural number]] following [[251 (number)|251]] and preceding [[253 (number)|253]]. |
'''252''' ('''two hundred [and] fifty-two''') is the [[natural number]] following [[251 (number)|251]] and preceding [[253 (number)|253]]. |
||
| Line 8: | Line 8: | ||
'''252''' is: |
'''252''' is: |
||
*the [[central binomial coefficient]] <math>\tbinom{10}{5}</math>, the largest one divisible by all coefficients in the previous line<ref>{{Cite OEIS|A000984|name=Central binomial coefficients}}</ref> |
*the [[central binomial coefficient]] <math>\tbinom{10}{5}</math>, the largest one divisible by all coefficients in the previous line<ref>{{Cite OEIS|A000984|name=Central binomial coefficients}}</ref> |
||
*a [[Harshad number]] in base 10. |
|||
*<math>\tau(3)</math>, where <math>\tau</math> is the [[Ramanujan tau function]].<ref>{{Cite OEIS|A000594|name=Ramanujan's tau function}}</ref> |
*<math>\tau(3)</math>, where <math>\tau</math> is the [[Ramanujan tau function]].<ref>{{Cite OEIS|A000594|name=Ramanujan's tau function}}</ref> |
||
*<math>\sigma_3(6)</math>, where <math>\sigma_3</math> is the [[Divisor function|function that sums the cubes of the divisors]] of its argument:<ref>{{Cite OEIS|A001158|name=sigma_3(n): sum of cubes of divisors of n}}</ref> |
*<math>\sigma_3(6)</math>, where <math>\sigma_3</math> is the [[Divisor function|function that sums the cubes of the divisors]] of its argument:<ref>{{Cite OEIS|A001158|name=sigma_3(n): sum of cubes of divisors of n}}</ref> |
||
:<math>1^3+2^3+3^3+6^3=(1^3+2^3)(1^3+3^3)=252.</math> |
:<math>1^3+2^3+3^3+6^3=(1^3+2^3)(1^3+3^3)=252.</math> |
||
*a [[practical number]],<ref>{{Cite OEIS|A005153|name=Practical numbers}}</ref> |
*a [[practical number]],<ref>{{Cite OEIS|A005153|name=Practical numbers}}</ref> |
||
*a [[refactorable number]],<ref>{{Cite web|url=https://oeis.org/A033950|title=Sloane's A033950 : Refactorable numbers |
*a [[refactorable number]],<ref>{{Cite web|url=https://oeis.org/A033950|title=Sloane's A033950 : Refactorable numbers|date=2016-04-18|website=The On-Line Encyclopedia of Integer Sequences|publisher=OEIS Foundation|access-date=2016-04-18}}</ref> |
||
*a [[hexagonal pyramidal number]].<ref>{{Cite OEIS|A002412|name=Hexagonal pyramidal numbers, or greengrocer's numbers}}</ref> |
*a [[hexagonal pyramidal number]].<ref>{{Cite OEIS|A002412|name=Hexagonal pyramidal numbers, or greengrocer's numbers}}</ref> |
||
*a member of the [[Mian–Chowla sequence|Mian-Chowla sequence]].<ref>{{Cite web|url=https://oeis.org/A005282|title=Sloane's A005282 : Mian-Chowla sequence |
*a member of the [[Mian–Chowla sequence|Mian-Chowla sequence]].<ref>{{Cite web|url=https://oeis.org/A005282|title=Sloane's A005282 : Mian-Chowla sequence|date=2016-04-19|website=The On-Line Encyclopedia of Integer Sequences|publisher=OEIS Foundation|access-date=2016-04-19}}</ref> |
||
There are 252 points on the surface of a [[cuboctahedron]] of radius five in the |
There are 252 points on the surface of a [[cuboctahedron]] of radius five in the [[FCC close packing|face-centered cubic]] lattice,<ref>{{Cite OEIS|A005901|name=Number of points on surface of cuboctahedron}}</ref> 252 ways of writing the number 4 as a sum of six squares of integers,<ref>{{Cite OEIS|A000141|name=Number of ways of writing n as a sum of 6 squares}}</ref> 252 ways of choosing four squares from a 4×4 chessboard up to reflections and rotations,<ref>{{Cite OEIS|A019318|name=Number of inequivalent ways of choosing n squares from an n X n board, considering rotations and reflections to be the same}}</ref> and 252 ways of placing three pieces on a [[Connect Four]] board.<ref>{{Cite OEIS|A090224|name=Number of possible positions for n men on a standard 7 X 6 board of Connect-Four}}</ref> |
||
==References== |
==References== |
||
Latest revision as of 17:07, 12 December 2022
| ||||
|---|---|---|---|---|
| Cardinal | two hundred fifty-two | |||
| Ordinal | 252nd (two hundred fifty-second) | |||
| Factorization | 22 × 32 × 7 | |||
| Divisors | 1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 63, 84, 126, 252 | |||
| Greek numeral | ΣΝΒ´ | |||
| Roman numeral | CCLII, cclii | |||
| Binary | 111111002 | |||
| Ternary | 1001003 | |||
| Senary | 11006 | |||
| Octal | 3748 | |||
| Duodecimal | 19012 | |||
| Hexadecimal | FC16 | |||
252 (two hundred [and] fifty-two) is the natural number following 251 and preceding 253.
In mathematics
[edit]252 is:
- the central binomial coefficient , the largest one divisible by all coefficients in the previous line[1]
- , where is the Ramanujan tau function.[2]
- , where is the function that sums the cubes of the divisors of its argument:[3]
- a practical number,[4]
- a refactorable number,[5]
- a hexagonal pyramidal number.[6]
- a member of the Mian-Chowla sequence.[7]
There are 252 points on the surface of a cuboctahedron of radius five in the face-centered cubic lattice,[8] 252 ways of writing the number 4 as a sum of six squares of integers,[9] 252 ways of choosing four squares from a 4×4 chessboard up to reflections and rotations,[10] and 252 ways of placing three pieces on a Connect Four board.[11]
References
[edit]- ^ Sloane, N. J. A. (ed.). "Sequence A000984 (Central binomial coefficients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000594 (Ramanujan's tau function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A001158 (sigma_3(n): sum of cubes of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A005153 (Practical numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "Sloane's A033950 : Refactorable numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. 2016-04-18. Retrieved 2016-04-18.
- ^ Sloane, N. J. A. (ed.). "Sequence A002412 (Hexagonal pyramidal numbers, or greengrocer's numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "Sloane's A005282 : Mian-Chowla sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. 2016-04-19. Retrieved 2016-04-19.
- ^ Sloane, N. J. A. (ed.). "Sequence A005901 (Number of points on surface of cuboctahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000141 (Number of ways of writing n as a sum of 6 squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A019318 (Number of inequivalent ways of choosing n squares from an n X n board, considering rotations and reflections to be the same)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A090224 (Number of possible positions for n men on a standard 7 X 6 board of Connect-Four)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
 | This article about a number is a stub. You can help Wikipedia by expanding it. |