252 (number)
252 (two hundred [and] fifty-two) is the natural number following 251 and preceding 253.
| ||||
|---|---|---|---|---|
[[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] | ||||
| 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 | |||
| Binary | 111111002 | |||
| Ternary | 1001003 | |||
| Octal | 3748 | |||
| Duodecimal | 19012 | |||
| Hexadecimal | FC16 | |||
In mathematics
252 is:
- the central binomial coefficient , the largest one divisible by all coefficients in the previous line[1]
- a Harshad number in base 10.
- , 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 fcc 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
- 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 is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.