14539
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17408
- Proper Divisor Sum (Aliquot Sum)
- 2869
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11880
- Möbius Function
- -1
- Radical
- 14539
- 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
- 71
- 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
- Quasi-Carmichael numbers to base -5: squarefree composites n such that prime p|n ==> p+5|n+5.at n=3A029565
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.at n=7A053019
- Let M be the matrix defined in A111490. Sequence gives the sum of the elements of the submatrices (from the upper left element): M(1,1); M(1,1)+M(1,2)+M(1,2)+M(2,2); M(1,1)+M(1,2)+M(1,3)+M(2,1)+M(2,2)+M(2,3)+M(3,1)+M(3,2)+M(3,3), etc.at n=38A123326
- Products of three distinct primes of the form 6*k + 1.at n=32A154729
- a(n) = b(n) + b(n+1) + 2, where b() = A000930().at n=24A170934
- Arises in the maximum number of C5's in a triangle-free graph.at n=34A185721
- a(n) = number of tuples (a,b,c,d) of natural numbers a,b,c,d <= n with gcd(a,b)=gcd(b,c)=gcd(c,d)=gcd(d,a)=1.at n=15A256391
- Number of length n+5 0..1 arrays with at most two downsteps in every 5 consecutive neighbor pairs.at n=8A256813
- Palindromic numbers in bases 4 and 6 written in base 10.at n=13A259376
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 557", based on the 5-celled von Neumann neighborhood.at n=23A272926
- Numbers n such that the Collatz iterations for n and n + 1 have the same length (A078417) but do not meet a certain condition. (See comments.)at n=20A274410
- Compound filter (2-adic valuation of phi(n) & sigma(n)): a(n) = P(A053574(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=59A286572
- Number of nX3 0..1 arrays with every element equal to 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A299597
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=47A299602
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=52A299602
- First occurrence of n in A334144.at n=42A333959
- a(n) = 1 + 2 * Sum_{k=0..n-1} binomial(n,k) * (n-k-1)! * a(k).at n=5A343707
- Number of vertices formed by infinite lines when connecting all vertices and all points that divide the sides of an equilateral triangle into n equal parts.at n=8A344657
- a(n) = Sum_{k=0..floor(n/3)} binomial(n,k) * binomial(n+2*k,n-3*k).at n=9A378407