439
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 440
- 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
- 438
- Möbius Function
- -1
- Radical
- 439
- 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
- 53
- 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
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 85
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- vierhundertneununddreißig· ordinal: vierhundertneununddreißigste
- English
- four hundred thirty-nine· ordinal: four hundred thirty-ninth
- Spanish
- cuatrocientos treinta y nueve· ordinal: 439º
- French
- quatre cent trente-neuf· ordinal: quatre cent trente-neufième
- Italian
- quattrocentotrentanove· ordinal: 439º
- Latin
- quadringenti triginta novem· ordinal: 439.
- Portuguese
- quatrocentos e trinta e nove· ordinal: 439º
Appears in sequences
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=20A000921
- Primes == +-1 (mod 8).at n=39A001132
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=3A001136
- A self-generating sequence: a(1)=1, a(2)=2, a(n+1) chosen so that a(n+1)-a(n-1) is the first number not obtainable as a(j)-a(i) for 1<=i<j<=n.at n=25A001149
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=26A001914
- Primes of the form 4*k + 3.at n=42A002145
- a(n) = least primitive factor of 2^(2n+1) - 1.at n=36A002184
- Primes of the form 6m + 1.at n=40A002476
- Numbers k such that binomial(2*k,k) is divisible by (k+1)^2.at n=38A002503
- a(n) = n + Sum_{k=1..n} pi(k), where pi() = A000720.at n=47A002815
- Number of n-node trees with a forbidden limb of length 4.at n=12A002990
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=26A003147
- Number of rooted trees with n vertices in which vertices at the same level have the same degree.at n=31A003238
- Numbers that are the sum of 9 positive 4th powers.at n=47A003343
- Numbers that are the sum of 11 positive 5th powers.at n=18A003356
- Primes congruent to {3, 5, 6} mod 7.at n=44A003625
- Inert rational primes in Q(sqrt(-5)).at n=45A003626
- Primes congruent to {5, 7} mod 8.at n=44A003628
- Inert rational primes in Q[sqrt(3)].at n=41A003630
- a(n) = floor(100*log_2(n)).at n=20A004262