509
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 510
- 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
- 508
- Möbius Function
- -1
- Radical
- 509
- 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
- 48
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 97
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- fünfhundertneun· ordinal: fünfhundertneunste
- English
- five hundred nine· ordinal: five hundred ninth
- Spanish
- quinientos nueve· ordinal: 509º
- French
- cinq cent neuf· ordinal: cinq cent neufième
- Italian
- cinquecentonove· ordinal: 509º
- Latin
- quingenti novem· ordinal: 509.
- Portuguese
- quinhentos e nove· ordinal: 509º
Appears in sequences
- Number of n-node rooted trees of height 3.at n=11A000235
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=12A000355
- Number of isomorphism classes of connected 3-regular (trivalent, cubic) loopless multigraphs of order 2n.at n=5A000421
- Primes with primitive root 2.at n=38A001122
- Smallest k such that the product of q/(q-1) over the primes from prime(n) to prime(n+k-1) is greater than 2.at n=16A001276
- Indices of prime Fibonacci numbers.at n=18A001605
- Full reptend primes: primes with primitive root 10.at n=36A001913
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=57A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=52A001916
- Number of partitions of n into nonprime parts.at n=35A002095
- Pythagorean primes: primes of the form 4*k + 1.at n=44A002144
- Primes congruent to 1 or 2 modulo 4; or, primes of form x^2 + y^2; or, -1 is a square mod p.at n=45A002313
- Largest prime factor of 1 + (product of first n primes).at n=5A002585
- Number of partitions of at most n into at most 5 parts.at n=16A002622
- Number of unlabeled trivalent (or cubic) connected simple graphs with 2n nodes.at n=7A002851
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=30A003107
- Number of nonequivalent dissections of an n-gon by nonintersecting diagonals rooted at a cell up to rotation.at n=5A003454
- Primes congruent to {3, 5, 6} mod 7.at n=49A003625
- Primes of the form 3n-1.at n=50A003627
- Primes p == +- 3 (mod 8), or, primes p such that 2 is not a square mod p.at n=49A003629