503
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 504
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 502
- Möbius Function
- -1
- Radical
- 503
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 66
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 96
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- fünfhundertdrei· ordinal: fünfhundertdreiste
- English
- five hundred three· ordinal: five hundred third
- Spanish
- quinientos tres· ordinal: 503º
- French
- cinq cent trois· ordinal: cinq cent troisième
- Italian
- cinquecentotre· ordinal: 503º
- Latin
- quingenti tres· ordinal: 503.
- Portuguese
- quinhentos e três· ordinal: 503º
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=20A000057
- 3rd power of rooted tree enumerator; number of linear forests of 3 rooted trees.at n=6A000242
- a(n) = 2^n - n.at n=9A000325
- Primes p == 7, 19, 23 (mod 40) such that (p-1)/2 is also prime.at n=8A000353
- Primes with 5 as smallest primitive root.at n=14A001124
- Primes == +-1 (mod 8).at n=45A001132
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=24A001305
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=48A001310
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=49A001310
- Indices of prime Lucas numbers.at n=22A001606
- Full reptend primes: primes with primitive root 10.at n=35A001913
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=56A001915
- Prime determinants of forms with class number 2.at n=44A002052
- From a Goldbach conjecture: records in A185091.at n=14A002092
- Primes of the form 4*k + 3.at n=50A002145
- Primitive roots that go with the primes in A029932.at n=24A002231
- Numbers k such that 33*2^k - 1 is prime.at n=22A002240
- Numbers k such that (k^2 + k + 1)/13 is prime.at n=24A002642
- Let F(x) = 1 + x + 4x^2 + 10x^3 + ... = g.f. for A000293 (solid partitions) and expand (1-x)(1-x^2)(1-x^3)...*F(x) in powers of x.at n=9A002836
- Number of n-node trees with a forbidden limb of length 5.at n=12A002991