329
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 384
- Proper Divisor Sum (Aliquot Sum)
- 55
- 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
- 276
- Möbius Function
- 1
- Radical
- 329
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Names
- German
- dreihundertneunundzwanzig· ordinal: dreihundertneunundzwanzigste
- English
- three hundred twenty-nine· ordinal: three hundred twenty-ninth
- Spanish
- trescientos veintinueve· ordinal: 329º
- French
- trois cent vingt-neuf· ordinal: trois cent vingt-neufième
- Italian
- trecentoventinove· ordinal: 329º
- Latin
- trecenti viginti novem· ordinal: 329.
- Portuguese
- trezentos e vinte e nove· ordinal: 329º
Appears in sequences
- Number of binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=17A000358
- Number of primes < prime(n)^2.at n=14A000879
- Sum_{n>=0} a(n)*x^n/n!^2 = BesselI(0,2*(1-exp(x))^(1/2)).at n=5A001569
- Mixed partitions of n.at n=17A002096
- Numbers k for which the rank of the elliptic curve y^2 = x^3 - k is 2.at n=43A002154
- Numbers k such that binomial(2*k,k) is divisible by (k+1)^2.at n=31A002503
- Number of "cubic partitions" of n: expansion of Product_{k>0} 1/((1-x^(2k))^2*(1-x^(2k-1))) in powers of x.at n=13A002513
- Numbers k such that (k^2 + 1)/2 is prime.at n=52A002731
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=43A002791
- Number of connected functions (or mapping patterns) on n unlabeled points, or number of rings and branches with n edges.at n=7A002861
- The square sieve.at n=30A002960
- Problimes (third definition).at n=56A003068
- Positions of letter c in the tribonacci word abacabaabacababac... generated by a->ab, b->ac, c->a (cf. A092782).at n=52A003146
- Szekeres's sequence: a(n)-1 in ternary = n-1 in binary; also: a(1) = 1, a(2) = 2, and thereafter a(n) is smallest number k which avoids any 3-term arithmetic progression in a(1), a(2), ..., a(n-1), k.at n=51A003278
- Numbers that are the sum of 9 positive 4th powers.at n=33A003343
- a(n) = 7*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.at n=4A004187
- a(n) = floor(100*log(n)).at n=26A004237
- a(n) = 3*n^2 + 3*n - 1.at n=10A004538
- Divisible only by primes congruent to 7 mod 8.at n=21A004628
- a(n) = floor(Fibonacci(n)/3).at n=16A004696