573
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 768
- Proper Divisor Sum (Aliquot Sum)
- 195
- 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
- 380
- Möbius Function
- 1
- Radical
- 573
- 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
- 105
- 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
- fünfhundertdreiundsiebzig· ordinal: fünfhundertdreiundsiebzigste
- English
- five hundred seventy-three· ordinal: five hundred seventy-third
- Spanish
- quinientos setenta y tres· ordinal: 573º
- French
- cinq cent soixante-treize· ordinal: cinq cent soixante-treizième
- Italian
- cinquecentosettantatre· ordinal: 573º
- Latin
- quingenti septuaginta tres· ordinal: 573.
- Portuguese
- quinhentos e setenta e três· ordinal: 573º
Appears in sequences
- Kendall-Mann numbers: the most common number of inversions in a permutation on n letters is floor(n*(n-1)/4); a(n) is the number of permutations with this many inversions.at n=6A000140
- a(n) = 3 * prime(n).at n=42A001748
- a(0) = 1, a(1) = 0, a(2) = -1; for n >= 3, a(n) = - a(n-2) + Sum_{ primes p with 3 <= p <= n} a(n-p).at n=50A002121
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=31A003107
- a(n) = floor((n^2 + 6n - 3)/4).at n=44A004116
- a(n) = floor((7*2^(n+1)-9*n-10)/3).at n=7A005262
- Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)at n=53A005662
- Number of irreducible positions of size n in Montreal solitaire.at n=7A007048
- Coordination sequence T6 for Zeolite Code BOG.at n=17A008054
- Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product_{i=0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index.at n=51A008302
- Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product_{i=0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index.at n=52A008302
- Expansion of (1+2*x^4+x^7)/((1-x)^2*(1-x^7)).at n=44A008824
- Expansion of (1+2*x^5+x^9)/((1-x)^2*(1-x^9)).at n=50A008825
- Expansion of e.g.f. log(arctanh(x) + exp(x)).at n=5A013167
- Numbers k such that 2^k == 8 (mod k).at n=51A015922
- Blum integers: numbers of the form p * q where p and q are distinct primes congruent to 3 (mod 4).at n=37A016105
- a(n) = 11n + 1.at n=52A017401
- a(n) = 12*n + 9.at n=47A017629
- a(n) = a(n-3) + a(n-4), with a(0)=1, a(1)=a(2)=0, a(3)=1.at n=38A017817
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16).at n=35A017856