14329
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 2951
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11616
- Möbius Function
- -1
- Radical
- 14329
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 102
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
Appears in sequences
- Divisors of 2^33 - 1.at n=7A003540
- Least positive integer k such that the fractional part of k*sqrt(5) has its n initial partial quotients all equal to 1.at n=10A004794
- a(n) = 5^n - n^4.at n=6A024053
- a(n) = C(n-1,1) + C(n-3,3) + ... + C(n-2*m-1,2*m+1), where m = floor((n-2)/4).at n=20A024490
- Denominators of continued fraction convergents to sqrt(562).at n=9A042077
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.at n=35A056132
- A multiplicative version of 2^n - 1 (A000225).at n=32A064084
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=32A066509
- a(1)=a(2)=1, a(n)=a(n-1)+a(n-2) if n is not congruent to 3, a(n)=a(n-1)+a(n/3) if n is congruent to 3.at n=25A078913
- a(n) = n*a(n-1) - (n-1)^2*a(n-2), a(0)=1, a(1)=1.at n=8A080171
- a(n) = floor((Fibonacci(2*n+1)+1)/2).at n=11A087953
- Expansion of (1+x)/((1+x+x^2)(1-x-x^2)).at n=21A093040
- Row sums of triangle A099510, so that a(n) = Sum_{k=0..n} coefficient of z^k in (1 + 2*z + z^2)^(n-[k/2]), where [k/2] is the integer floor of k/2.at n=10A099511
- Expansion of g.f. (1+x)^2/((1 + x + x^2)*(1 + x - x^2)).at n=24A106511
- a(n) = floor[(phi + n mod 2)*a(n-1)], a(1)=1.at n=15A107857
- a(n) = b(k), where b(k) = Fibonacci(n-1) and k = floor( n*(1+sqrt(5))/2 ).at n=15A107858
- Expansion of (1-x)^3/(1-4x+5x^2-4x^3+x^4).at n=11A109961
- Sums of p-th to the q-th prime where p and q are twin primes.at n=28A114379
- Odd winning positions in Fibonacci nim.at n=36A120904
- Numbers n such that 6^n+5 is prime.at n=22A145106