14316
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 33432
- Proper Divisor Sum (Aliquot Sum)
- 19116
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4768
- Möbius Function
- 0
- Radical
- 7158
- Omega Function (Ω)
- 4
- 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
- 76
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Sociable numbers: smallest member of each cycle (conjectured).at n=1A003416
- Coordination sequence for MgZn2, Position Zn2.at n=30A009938
- Coordination sequence for sigma-CrFe, Position Xa.at n=30A009962
- a(n) = Sum_{k=0..floor(n/2)} T(n-k,k), T given by A026747.at n=18A026757
- a(n) is the smallest number not already used such that a(n)*a(n-1)*a(n-2) + 1 is a square, with a(1)=1 and a(2)=2.at n=29A064691
- The 28-cycle of the n => sigma(n)-n process, where sigma(n) is the sum of divisors of n (A000203).at n=0A072890
- The 28-cycle of the n => sigma(n)-n process, where sigma(n) is the sum of divisors of n (A000203).at n=28A072890
- Numbers k such that 10^k+9^(k-1) is prime.at n=21A096186
- Number of permutations of length n which avoid the patterns 321, 2143, 3124; or avoid the patterns 132, 2314, 4312, etc.at n=35A116731
- Conjectured list of sociable numbers.at n=3A122726
- 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, 0, 0), (0, 0, 1), (0, 1, 1), (1, 0, -1)}.at n=8A150076
- Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with no more than 9 ones in any 4 X 4 X 4 subtriangle.at n=11A153967
- Conjectured list of smallest terms of k-sociable cycles of order r.at n=14A183016
- Triangle T(n,k), read by rows, given by (2,1/2,-1/2,0,0,0,0,0,0,0,...) DELTA (2,-1/2,1/2,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.at n=38A201972
- Number of partitions of n such that m(greatest part) < m(1), where m = multiplicity.at n=37A240076
- Draw a square and follow these steps: Take a square and place at its edges isosceles right triangles with the edge as hypotenuse. Draw a square at every new edge of the triangles. Repeat for all the new squares of the same size. New figures are only placed on empty space. The structure is symmetric about the first square. The sequence gives the numbers of squares of equal size in successive rings around the center.at n=19A265207
- a(n) = 54*n^2 - 78*n + 36.at n=17A277983
- The forgotten topological index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.1).at n=9A292346
- Number of shapes of grid-filling curves of order A001481(n) (on the square grid) with turns by +-90 degrees that are generated by folding morphisms.at n=20A296147
- Number of shapes of grid-filling curves of order n (on the square grid) with turns by +-90 degrees that are generated by folding morphisms.at n=40A296148