14002
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21006
- Proper Divisor Sum (Aliquot Sum)
- 7004
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7000
- Möbius Function
- 1
- Radical
- 14002
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Coordination sequence for 5-dimensional cubic lattice.at n=10A008413
- Coordination sequence for C_5 lattice.at n=5A019561
- Triangular array read by rows associated with Schroeder numbers: T(1,k) = 1; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).at n=50A033877
- Number of points of L1 norm 10 in cubic lattice Z^n.at n=5A035604
- Numbers whose base-7 representation contains exactly four 5's.at n=22A043416
- Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).at n=50A056242
- Integer part of log(n^n)^(1 + log(1 + log(n))).at n=19A062449
- Expansion of g.f. x*(1+x)^4/(1-x)^6.at n=10A069038
- a(n) = floor(sum_{k>=0} k^n /(k!)^3); related to generalized Bell numbers.at n=13A088022
- Triangle, read by rows, such that row n equals the inverse binomial transform of column n of the triangle A034870 of coefficients in successive powers of the trinomial (1+2*x+x^2), omitting leading zeros.at n=49A099605
- Square array A(n,k) read by antidiagonals: row n gives coordination sequence for lattice C_n.at n=41A103884
- a(n) = [x^(2*n)] ((1 + x)/(1 - x))^n.at n=5A103885
- Triangular array associated with Schroeder numbers: T(0,0) = 1, T(n,0) = 0 for n > 0; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).at n=61A106579
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 (i.e., E steps from the line y=x+1 to the line y = x).at n=30A110098
- Triangle related to partitions of n.at n=49A117317
- Riordan array (1, x*f(x)) where f(x)is the g.f. of A006318.at n=60A122538
- a(n) = Floor(Fibonacci(n)^(1/Pi)).at n=64A171962
- Triangle read by rows: T(n,k) is the number of L-convex polyominoes of semiperimeter n, having k maximal rectangles (n >= 2, 1 <= k <= floor(n/2)). An L-convex polyomino is a convex polyomino in which any two cells can be connected by a path internal to the polyomino and which has at most 1 change of direction (i.e., one of the four orientations of the letter L). A maximal rectangle in an L-convex polyomino P is a rectangle included in P that is maximal with respect to inclusion.at n=27A181368
- Semiprimes that are the sum of 10 consecutive primes.at n=17A185347
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210754; see the Formula section.at n=49A210753