14680
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 33120
- Proper Divisor Sum (Aliquot Sum)
- 18440
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5856
- Möbius Function
- 0
- Radical
- 3670
- 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
- Convolution of the lower and upper Wythoff sequences (A000201 and A001950).at n=26A023664
- Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++.at n=20A096558
- a(n) = number of distinct values of Product_{i=1..r} x_i!*i!^x_i, where (x_1, ..., x_r) is an r-tuple of nonnegative integers with Sum_{i=1..r} i*x_i = n.at n=46A102465
- Number of compositions of n into 4 parts such that no two adjacent parts are equal.at n=42A106353
- a(n) = Sum_{k=0..floor(n/2)} binomial(2n-2k,2k)3^k*2^(n-k).at n=6A108486
- a(n) = the definite integral Integral_{0..1} Product_{j=1..n} 4*sin^2(Pi*j*x) dx.at n=25A133871
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1001-1111-1001 pattern in any orientation.at n=14A146928
- Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=11A186393
- Number of (w,x,y) with all terms in {0,...,n} and |w-x| + |x-y| + |y-w| >= w + x + y.at n=36A213489
- Triangular array counting derangements by number of descents.at n=37A219836
- 28-gonal pyramidal numbers: a(n) = n*(n+1)*(26*n-23)/6.at n=15A256648
- Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.at n=23A256890
- Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.at n=25A256890
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 603", based on the 5-celled von Neumann neighborhood.at n=23A273173
- Start with 209; if even, divide by 2; if odd, add the next three primes: Trajectory of 209 under iterations of A174221, the "PrimeLatz" map.at n=12A293981
- Expansion of e.g.f. -log(1 - x) * exp(4*x).at n=6A346396
- Number of cells in a regular 7-gon after n generations of mitosis.at n=20A349808
- Numbers k such that the decimal expansion of k and 14^k both begin with 14.at n=23A352239
- Number of ways to write n as an ordered sum of eight positive Fibonacci numbers (with a single type of 1).at n=15A357716
- Maximal coefficient of (1 - x)^2 * (1 - x^2)^2 * (1 - x^3)^2 * ... * (1 - x^n)^2.at n=26A369710