253
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 288
- Proper Divisor Sum (Aliquot Sum)
- 35
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 220
- Möbius Function
- 1
- Radical
- 253
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 109
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Names
- German
- zweihundertdreiundfünfzig· ordinal: zweihundertdreiundfünfzigste
- English
- two hundred fifty-three· ordinal: two hundred fifty-third
- Spanish
- doscientos cincuenta y tres· ordinal: 253º
- French
- deux cent cinquante-trois· ordinal: deux cent cinquante-troisième
- Italian
- duecentocinquantatre· ordinal: 253º
- Latin
- ducenti quinquaginta tres· ordinal: 253.
- Portuguese
- duzentos e cinquenta e três· ordinal: 253º
Appears in sequences
- Number of partitions of n if there are two kinds of 1's and two kinds of 2's.at n=10A000097
- Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) with a(0) = a(1) = a(2) = a(3) = a(4) = 1.at n=11A000322
- Number of points of norm <= n^2 in square lattice.at n=9A000328
- Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers).at n=49A000926
- Dimension of the n-th graded piece of the mod-2 Steenrod algebra A_2.at n=61A000929
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=17A000960
- Dimensions (sorted, with duplicates removed) of real simple Lie algebras.at n=53A001066
- Leech triangle: k-th number (0 <= k <= n) in n-th row (0 <= n) is number of octads in S(5,8,24) containing k given points and missing n-k given points.at n=2A001293
- The coding-theoretic function A(n,4,3).at n=39A001839
- Related to Zarankiewicz's problem.at n=20A001841
- v-pile counts for the 4-Wythoff game with i=2.at n=48A001966
- Nearest integer to n^2/8.at n=45A001971
- Expansion of 1/((1-x)^2*(1-x^4)) = 1/( (1+x)*(1+x^2)*(1-x)^3 ).at n=42A001972
- Numbers dividing A002037(i) and larger than A002037(i-1), for some i>0.at n=20A002038
- Weight distribution of [ 23,12,7 ] binary perfect Golay code.at n=7A002289
- Weight distribution of [ 23,12,7 ] binary perfect Golay code.at n=16A002289
- Let p = A007645(n) be the n-th generalized cuban prime and write p^2 = x^2 + 3*y^2 with y > 0; a(n) = x.at n=47A002367
- Odd squarefree numbers with an even number of prime factors that have no prime factors greater than 31.at n=30A002557
- Integers connected with coefficients in expansion of Weierstrass P-function.at n=2A002770
- a(n) = nearest integer to n^(3/2).at n=40A002821