504
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 1560
- Proper Divisor Sum (Aliquot Sum)
- 1056
- 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
- 144
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 6
- 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
- yes
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 110
- 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ünfhundertvier· ordinal: fünfhundertvierste
- English
- five hundred four· ordinal: five hundred fourth
- Spanish
- quinientos cuatro· ordinal: 504º
- French
- cinq cent quatre· ordinal: cinq cent quatrième
- Italian
- cinquecentoquattro· ordinal: 504º
- Latin
- quingenti quattuor· ordinal: 504.
- Portuguese
- quinhentos e quatro· ordinal: 504º
Appears in sequences
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.at n=13A000073
- Coefficient of x^5 in expansion of (1 + x + x^2)^n.at n=5A000574
- Number of partitions of n into prime parts.at n=45A000607
- Semi-meanders: number of ways a semi-infinite directed curve can cross a straight line n times.at n=8A000682
- Expansion of modular function 1/E_3 (cf. A013973).at n=1A000706
- a(n) = (2n+3)!/(n!*(n+2)!).at n=3A000917
- Orders of noncyclic simple groups (without repetition).at n=3A001034
- Number of cells of square lattice of edge 1/n inside quadrant of unit circle centered at 0.at n=25A001182
- If F(n) is the n-th Fibonacci number, then a(2n) = (F(2n+1) + F(n+2))/2 and a(2n+1) = (F(2n+2) + F(n+1))/2.at n=14A001224
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=54A001301
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=58A001312
- NPN-equivalence classes of threshold functions of exactly n variables.at n=6A001530
- a(n) = (5*n+1)*(5*n+4).at n=4A001545
- 2nd differences of factorial numbers.at n=4A001564
- a(n) = n!/6!.at n=3A001730
- The coding-theoretic function A(n,4,3).at n=55A001839
- Highly abundant numbers: numbers k such that sigma(k) > sigma(m) for all m < k.at n=35A002093
- Generalized sum of divisors function.at n=20A002132
- E.g.f.: high-temperature series in J/2kT for logarithm of partition function for the spin-1/2 linear (1D) Heisenberg model.at n=5A002164
- Number of divisors of n-th highly composite number.at n=48A002183