252
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 728
- Proper Divisor Sum (Aliquot Sum)
- 476
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 72
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 109
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- zweihundertzweiundfünfzig· ordinal: zweihundertzweiundfünfzigste
- English
- two hundred fifty-two· ordinal: two hundred fifty-second
- Spanish
- doscientos cincuenta y dos· ordinal: 252º
- French
- deux cent cinquante-deux· ordinal: deux cent cinquante-deuxième
- Italian
- duecentocinquantadue· ordinal: 252º
- Latin
- ducenti quinquaginta duo· ordinal: 252.
- Portuguese
- duzentos e cinquenta e dois· ordinal: 252º
Appears in sequences
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=19A000064
- a(n) = floor(n^(3/2)).at n=40A000093
- a(n) = n*(n+3)/2.at n=21A000096
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=24A000114
- Number of ways of writing n as a sum of 6 squares.at n=4A000141
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=17A000223
- Binomial coefficients C(n,5).at n=10A000389
- Number of symmetric ways of folding a strip of n labeled stamps.at n=6A000560
- Ramanujan's tau function (or Ramanujan numbers, or tau numbers).at n=2A000594
- Number of 2n-bead balanced binary necklaces of fundamental period 2n, equivalent to reversed complement; also Dirichlet convolution of b_n=2^(n-1) with mu(n); also number of components of Mandelbrot set corresponding to Julia sets with an attractive n-cycle.at n=8A000740
- Numbers that are divisible by at least three different primes.at n=42A000977
- Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.at n=5A000984
- sigma_3(n): sum of cubes of divisors of n.at n=5A001158
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=53A001195
- Double-bitters: only even length runs in binary expansion.at n=14A001196
- Numbers that are the sum of 4 cubes in more than 1 way.at n=9A001245
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=19A001305
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=39A001310
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=38A001310
- Number of n-node trees of height at most 5.at n=9A001385