500
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1092
- Proper Divisor Sum (Aliquot Sum)
- 592
- 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
- 200
- Möbius Function
- 0
- Radical
- 10
- Omega Function (Ω)
- 5
- 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
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- fünfhundert· ordinal: fünfhundertste
- English
- five hundred· ordinal: five hundredth
- Spanish
- quinientos· ordinal: 500º
- French
- cinq cents· ordinal: cinq centsième
- Italian
- cinquecento· ordinal: 500º
- Latin
- quingenti· ordinal: 500.
- Portuguese
- quinhentos· ordinal: 500º
Appears in sequences
- Number of plane partitions (or planar partitions) of n.at n=10A000219
- a(0) = a(1) = 1; thereafter a(n) = sigma(a(n-1)) + sigma(a(n-2)).at n=9A000458
- Numbers k such that k / (sum of digits of k) is a square.at n=27A001102
- a(n) = sigma_2(n): sum of squares of divisors of n.at n=20A001157
- Powerful numbers, definition (1): if a prime p divides n then p^2 must also divide n (also called squareful, square full, square-full or 2-powerful numbers).at n=36A001694
- Numbers k such that 13*4^k + 1 is prime.at n=9A002257
- a(n) = n*phi(n).at n=24A002618
- a(n) = Sum_{d|n, d <= 3} d^2 + 3*Sum_{d|n, d>3} d.at n=59A002660
- Numbers that are the sum of 5 positive 4th powers.at n=30A003339
- Numbers that are the sum of 10 positive 5th powers.at n=20A003355
- Roman numerals with 1 letter, in numerical order; then those with 2 letters, etc.at n=5A003587
- Roman numerals with 1 letter, in alphabetical order; then those with 2 letters, etc.at n=1A003588
- Numbers of the form 2^i*5^j with i, j >= 0.at n=23A003592
- a(n) = floor(100*log_2(n)).at n=31A004262
- a(n) = round(100*log_2(n)).at n=31A004263
- a(n) = ceiling(100*log_2(n)).at n=31A004264
- a(0) = 1; a(n) = 4*5^(n-1) for n >= 1.at n=4A005054
- Record gaps between primes.at n=44A005250
- Theta series of P_{10b} packing.at n=1A005954
- Number of bipartite polyhedral graphs with n nodes.at n=9A007028