14384
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 29760
- Proper Divisor Sum (Aliquot Sum)
- 15376
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 1798
- Omega Function (Ω)
- 6
- 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
- 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
- Number of integers <= 2^n of form x^2 - 2y^2.at n=16A000047
- Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis.at n=28A005564
- Number of partitions satisfying (cn(0,5) <= cn(1,5) = cn(4,5)).at n=51A036809
- Lesser members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=33A054573
- Numbers k such that phi(k) = Sum_{d|k} core(d) where core(x) is the squarefree part of x (A007913).at n=8A074786
- Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the factorials, starting with row 0: {1!,2!,3!,...}.at n=49A089900
- Admirable numbers n such that the subtracted divisor is > sqrt(n).at n=28A109321
- a(n) = 16*n*(n+2).at n=29A114444
- Numbers m such that A049060(m)*sigma(m) = k*uphi(m)*m for some integer k.at n=4A122483
- Call (m,n) a "(-1)SSU amicable pair" if (-1)Sigma(m)*Sigma(m) = k*UnitaryPhi(m)*(m+n) and (-1)Sigma(n)*Sigma(n) = k*UnitaryPhi(n)*(m+n) for some integer k. Sequence gives values of m, assuming n <= m.at n=4A123728
- (k^2)-th k-smooth number for k = prime(n).at n=16A133581
- Triangle read by rows: t(n,m)=(1 + n!)*Binomial[n, m]-n!/Binomial[n, m].at n=24A144397
- a(n) = 64*n^2 - 16.at n=14A157913
- a(n) = 225*n^2 - 2*n.at n=7A158226
- a(n) = sigma(n)*|A002129(n)| where sigma(n) = A000203(n).at n=47A162419
- Numbers d*p where d is a perfect number and p<d a prime not dividing d.at n=16A165772
- Expansion of e.g.f.: (1+x+x^2+x^3)^x.at n=8A191423
- Number of n X 2 0..3 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero.at n=5A230964
- T(n,k) = Number of n X k 0..3 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero.at n=22A230968
- T(n,k) = Number of n X k 0..3 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero.at n=26A230968