14330
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25812
- Proper Divisor Sum (Aliquot Sum)
- 11482
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5728
- Möbius Function
- -1
- Radical
- 14330
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor(n*phi^14), where phi is the golden ratio, A001622.at n=17A004929
- a(n) = 7*2^n - 6.at n=11A048489
- G.f.: (1+3*x+2*x^2)/((1-x)*(1-2*x^2)).at n=22A063757
- Expansion of (-1+2x+2x^2)/((1+x+x^2)(1-x-x^2)).at n=22A100887
- Numbers n such that sigma(n)=2n-phi(phi(n)).at n=15A110073
- Irregular array where the n-th row are the divisors, not occurring earlier in the sequence, of the sum of the terms in all previous rows. a(1)=5.at n=30A120579
- Triangle P, read by rows, where column k of P^3 equals column 0 of P^(3k+3) such that column 0 of P^3 equals column 0 of P shift one row up, with P(0,0)=1.at n=40A136220
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (-1, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=9A148662
- a(n)=Mod(2^Fibonacci(n),Fibonacci(n)).at n=25A171244
- Number of numbers <= p^2 with largest prime factor <= p, where p is the n-th prime; a(0) = 1.at n=45A184677
- The Wiener index of the double-comb graph \/_\/_\/...\/_\/ with 3n (n>=1) nodes. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph.at n=19A192025
- Expansion of (1+4*x+5*x^2-x^3)/((1-x)*(1+x)*(1-2*x^2)).at n=22A220753
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=40A229467
- Sphenic numbers (A007304) whose neighbors are sphenic.at n=32A248202
- a(n) = a(n-1) + 2*a(n-4) - 2*a(n-5) for n >= 5, where a(0) = 2, a(1) = 4, a(2) = 6, a(3) = 8, a(4) = 10.at n=43A288732
- Number of permutations of [n] avoiding {2431, 1324, 1342}.at n=9A294825
- Number of refinement-ordered pairs of strict integer partitions of n.at n=32A317142