550
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1116
- Proper Divisor Sum (Aliquot Sum)
- 566
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 200
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 4
- 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
- 92
- 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
- fünfhundertfünfzig· ordinal: fünfhundertfünfzigste
- English
- five hundred fifty· ordinal: five hundred fiftieth
- Spanish
- quinientos cincuenta· ordinal: 550º
- French
- cinq cent cinquante· ordinal: cinq cent cinquantième
- Italian
- cinquecentocinquanta· ordinal: 550º
- Latin
- quingenti quinquaginta· ordinal: 550.
- Portuguese
- quinhentos e cinquenta· ordinal: 550º
Appears in sequences
- 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); sequence gives values of n where |P(n)| sets a new record.at n=21A000092
- a(n) is the solution to the postage stamp problem with n denominations and 4 stamps.at n=10A001214
- The coding-theoretic function A(n,4,4).at n=21A001843
- Number of partitions of an n-gon into (n-5) parts.at n=2A002060
- Numbers k such that the k-th tetrahedral number is the sum of 2 tetrahedral numbers.at n=19A002311
- Numbers of the form (p^2 - 49)/120 where p is prime.at n=26A002382
- Pentagonal pyramidal numbers: a(n) = n^2*(n+1)/2.at n=10A002411
- Numbers k such that (k^2 + k + 1)/21 is prime.at n=29A002644
- Beginnings of periodic unitary aliquot sequences.at n=46A003062
- Numbers that are the sum of 4 positive 5th powers.at n=11A003349
- Roman numerals with 1 letter, in numerical order; then those with 2 letters, etc.at n=28A003587
- Roman numerals with 1 letter, in alphabetical order; then those with 2 letters, etc.at n=16A003588
- Degrees of irreducible representations of alternating group A_11.at n=15A003866
- Degrees of irreducible representations of symmetric group S_11.at n=28A003875
- Degrees of irreducible representations of symmetric group S_11.at n=27A003875
- Numbers that are the sum of at most 4 positive 5th powers.at n=30A004844
- Numbers that are the sum of at most 5 positive 5th powers.at n=43A004845
- a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.at n=23A004978
- Primitive pseudoperfect numbers.at n=12A006036
- Primitive nondeficient numbers.at n=11A006039