14808
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 37080
- Proper Divisor Sum (Aliquot Sum)
- 22272
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4928
- Möbius Function
- 0
- Radical
- 3702
- Omega Function (Ω)
- 5
- 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
- 133
- 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 sums S of distinct positive integers satisfying S <= n.at n=43A026906
- McKay-Thompson series of class 18E for Monster.at n=20A058535
- Self-convolution of A086582; the first 2^n terms of this sequence gives the 2^n terms that follow the 2^n-th term of A086582.at n=43A086583
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).at n=42A095234
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at odd levels (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1.at n=56A114586
- a(n) = (n+1)*Fibonacci(n+2) + 3.at n=14A123194
- Row sums of triangle A127058.at n=5A127060
- McKay-Thompson series of class 18E for the Monster group with a(0) = 3.at n=20A128517
- Number of n X n binary arrays with all ones connected only in a 0110-1111-0110 pattern in any orientation.at n=8A146917
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, -1), (0, 0, 1), (1, 0, 0)}.at n=8A150087
- x-values in the solution to x^2 - 13y^2 = 27.at n=4A228203
- Number T(n,k) of permutations of [n] with exactly k (possibly overlapping, cyclic wrap-around) occurrences of the consecutive step pattern UDU (U=up, D=down); triangle T(n,k), n>=0, 0<=k<=floor(n/2), read by rows.at n=22A232933
- Number of partitions p of n such that (maximal multiplicity of the parts of p) <= (maximal part of p).at n=36A240311
- Numbers k with the property that p = k^2 - 13 and q = k^2 + 13 are consecutive primes.at n=34A248785
- a(n) = Sum_{k=0..n/2} binomial(n+3,k)*binomial(n+1-k,k+1).at n=9A262720
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 278", based on the 5-celled von Neumann neighborhood.at n=35A271097
- Expansion of Product_{n>=1} (1 - x^(5*n))^12/(1 - x^n)^13 in powers of x.at n=5A278555
- a(n) is the number of (strict) chains of subspaces with ends 0 and (F_4)^n.at n=4A347842
- A(n,k) is the sum over all ordered partitions of [n] of k^j for an ordered partition with j inversions; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=40A381426
- Sum over all ordered partitions of [n] of n^j for an ordered partition with j inversions.at n=4A381427