14070
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 39168
- Proper Divisor Sum (Aliquot Sum)
- 25098
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- -1
- Radical
- 14070
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 107
- 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
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^10 in powers of x.at n=17A001488
- Number of trees on n labeled vertices with degree at most 3.at n=6A003692
- Number of n-covers of an unlabeled 3-set.at n=12A005745
- Triangle read by rows, the inverse Bell transform of n!*binomial(5,n) (without column 0).at n=42A013988
- Expansion of 1/((1-x)*(1-4*x)*(1-5*x)).at n=5A016218
- Multiplicity of highest weight (or singular) vectors associated with character chi_176 of Monster module.at n=38A034564
- Number of bipartite graphs with 3 edges on nodes {1..n}.at n=10A053526
- Number of step cyclic shifted sequences using a maximum of five different symbols.at n=7A056413
- T(n,k) = Points in n-dimensional lattice of side length k with at least one coordinate = k and GCD of all coordinates = 1.at n=62A090225
- Triangle read by rows: T(n, m) = number of forests with n nodes and m labeled trees. Also number of forests with exactly n - m edges on n labeled nodes.at n=51A105599
- Matrix log of triangle A111820, which shifts columns left and up under matrix 5th power; these terms are the result of multiplying each element in row n and column k by (n-k)!.at n=16A111823
- Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=31A125016
- Records for unitary abundant numbers, i.e., those integers which set a record for having a greater unitary abundance than any of their predecessors.at n=36A129499
- Triangle read by rows: A007318^(-1) * A132812.at n=62A132816
- Triangle read by rows: T(n, k) is the number of forests on n labeled nodes with k edges. T(n, k) for n >= 1 and 0 <= k <= n-1.at n=48A138464
- a(n) = n*(8*n-1).at n=42A139274
- a(n) is the minimal values of A007947((2^n)*m*(2^n-m)).at n=19A143702
- Numbers n such that 30n-13, 30n-11, 30n-1, 30n+1, 30n+11, 30n+13 are all prime.at n=10A175683
- Fourth accumulation array of A051340, by antidiagonals.at n=58A185876
- Triangle read by rows: rook numbers of certain "probleme des rencontres" boards of the second kind of size n X k (0 <= k <= n).at n=30A220905