14356
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26068
- Proper Divisor Sum (Aliquot Sum)
- 11712
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- 0
- Radical
- 7178
- 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
- 71
- 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
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=45A005892
- Number of reversible string structures with n beads using exactly three different colors.at n=10A056327
- Number of primitive (aperiodic) reversible string structures with n beads using exactly three different colors.at n=10A056337
- For n>=2, the number of (s(0), s(1), ..., s(n-1)) such that 0 < s(i) < 5 and |s(i) - s(i-1)| <= 1 for i = 1,2,....,n-1, s(0) = 2, s(n-1) = 2.at n=12A059512
- Least k such that Sum_{i=1..k} (prime(i) + prime(i+2) - 2*prime(i+1)) = 2n + 1.at n=42A073051
- Index of the first occurrence of A019565(2n-1) in sequence A103790.at n=27A103791
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=45A118312
- Indices of primes occurring in A031133.at n=21A122412
- Generator for the finite sequence A053016.at n=36A136254
- G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^4)^5.at n=6A137965
- 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, 1), (1, 0, 0), (1, 1, -1)}.at n=11A148087
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2 n steps taken from {(-1, -1), (-1, 1), (1, -1), (1, 0)}.at n=6A151500
- a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime.at n=37A152527
- A Fibonacci convolution.at n=11A164267
- Number of (w,x,y,z) with all terms in {1,...,n} and w<x*y*z.at n=11A212057
- Number of partitions p of n such that (number of parts of p) - min(p) is a part of p.at n=44A238547
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any vertical or antidiagonal neighbor equal to n-1.at n=38A266042
- Number of 3Xn arrays containing n copies of 0..3-1 with no element plus any vertical or antidiagonal neighbor equal to 3-1.at n=6A266043
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 563", based on the 5-celled von Neumann neighborhood.at n=23A272941
- a(n) = PrimePi(A246033(n)) (where PrimePi = A000720).at n=40A290652