14146
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23184
- Proper Divisor Sum (Aliquot Sum)
- 9038
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6420
- Möbius Function
- -1
- Radical
- 14146
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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 that are the sum of 6 nonzero 8th powers.at n=17A003384
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=41A005286
- Numbers n such that phi(n + 1) | sigma(n) for n congruent to 1 (mod 3).at n=34A015817
- Numbers k such that sigma(k) = 2*phi(k+1).at n=17A068423
- Number of degree n polynomials over GF(2) (with nonzero constant term) at Hamming distance 3 from some irreducible polynomial.at n=21A128903
- Number of reduced words of length n in the Weyl group A_43.at n=3A161668
- The numbers n in s=n^2 + (n+1)^2 that satisfy the requirement for two consecutive squares c,d with c<d with d-c being the sum of two consecutive squares that c<s<d will give s-c and d-s both being squares.at n=19A192743
- Triangular array: the fission of (p(n,x)) by ((2x+1)^n), where p(n,x)=(x+1)^n.at n=49A193856
- Number of (w,x,y,z) with all terms in {1,...,n} and w<x+y+z.at n=11A212090
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 1.at n=38A259577
- Expansion of Product_{k>=1} 1/(1 - x^(2*k-1))^(k*(3*k+1)/2).at n=14A294668
- Irregular triangle read by rows: T(n,k) is the number of connected permutation graphs on n vertices with domination number k, with 1 <= k <= floor(n/2).at n=19A320583
- Number of unlabeled simple graphs covering n vertices with at most n edges.at n=12A370316
- G.f. satisfies A(x) = 1 / (1 - x^4*A(x)^4 / (1 - x)).at n=20A376491