14106
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
- 8
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 14118
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4700
- Möbius Function
- -1
- Radical
- 14106
- 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
- 120
- 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
- Numbers k such that 283*2^k + 1 is prime.at n=5A053358
- Number of graphs with 3 distinct components.at n=5A058915
- Convolution of the prime numbers with phi(n).at n=33A086734
- Molien series for 16-dimensional group of structure Z_2^4.S_3 and order 96, corresponding to complete weight enumerators of Hermitian self-dual GF(4)-linear codes over GF(16) containing the all-ones vector.at n=9A092497
- Sum of the odd parts in all partitions of n into distinct parts.at n=37A116682
- a(n) = 2*a(n-1) - a(n-2) + n + 1.at n=42A121968
- Triangular array read by rows. T(n,k) is the number of unlabeled graphs on n nodes that have exactly k distinct components (n >= 1).at n=27A217955
- Number of Sidon subsets of {1,...,n} of size 6.at n=27A241690
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00010101 or 01010101.at n=6A261288
- Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00010101 or 01010101.at n=3A261291
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 675", based on the 5-celled von Neumann neighborhood.at n=21A273408
- Number of nX4 0..2 arrays with no element equal to more than one of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=3A280957
- T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=24A280961
- Number of ways to split an n-cycle into connected subgraphs, all having at least three vertices.at n=25A323951
- Number of sexy consecutive prime pairs below 2^n.at n=19A341843
- Zumkeller numbers k (A083207) such that the next Zumkeller number is k + 12.at n=37A345704
- Numbers that are a sum of both four and six consecutive prime numbers.at n=26A380433