453
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 608
- Proper Divisor Sum (Aliquot Sum)
- 155
- 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
- 300
- Möbius Function
- 1
- Radical
- 453
- 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
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 14
- 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
- vierhundertdreiundfünfzig· ordinal: vierhundertdreiundfünfzigste
- English
- four hundred fifty-three· ordinal: four hundred fifty-third
- Spanish
- cuatrocientos cincuenta y tres· ordinal: 453º
- French
- quatre cent cinquante-trois· ordinal: quatre cent cinquante-troisième
- Italian
- quattrocentocinquantatre· ordinal: 453º
- Latin
- quadringenti quinquaginta tres· ordinal: 453.
- Portuguese
- quatrocentos e cinquenta e três· ordinal: 453º
Appears in sequences
- a(1) = a(2) = 1, a(3) = 4; thereafter a(n) = a(n-1) + a(n-3).at n=15A001609
- a(n) = 3 * prime(n).at n=35A001748
- a(n) = a(n-1) + a(n-2) - a(n-3).at n=17A002798
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=29A003107
- a(n) = A001950(A003234(n)) + 1.at n=47A003249
- Numbers that are the sum of 8 positive 4th powers.at n=44A003342
- Numbers that are the sum of 12 positive 6th powers.at n=7A003368
- Divisors of 2^30 - 1.at n=18A003538
- Number of partitions of 1/n into 3 reciprocals of positive integers.at n=34A004194
- a(n) = ceiling(100*log_2(n)).at n=22A004264
- Cald's sequence: a(n+1) = a(n) - prime(n) if that value is positive and new, otherwise a(n) + prime(n) if new, otherwise 0; start with a(1)=1.at n=87A006509
- Number of strict first-order maximal independent sets in path graph.at n=21A007383
- Inverse Moebius transform applied twice to squares.at n=15A007433
- Numbers m such that m, m+1 and m+2 are squarefree.at n=59A007675
- Generated by a sieve: keep first number, drop every 2nd, keep first, drop every 3rd, keep first, drop every 4th, etc.at n=37A007952
- Poincaré series (or Poincare series) of Lie algebra associated with a certain braid group.at n=3A007994
- Coordination sequence T1 for Zeolite Code AFO.at n=14A008015
- Coordination sequence T2 for Zeolite Code CAS.at n=13A008064
- Coordination sequence T6 for Zeolite Code MFS.at n=13A008178
- Coordination sequence T2 for Zeolite Code THO.at n=15A008239