14892
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 37296
- Proper Divisor Sum (Aliquot Sum)
- 22404
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 7446
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- Denominators of continued fraction convergents to sqrt(861).at n=9A042663
- Ulam numbers such that 2*n is also an Ulam number.at n=20A068791
- Numbers k such that 2^k + 3^(k-1) is prime.at n=49A082400
- A014486-encoding of symmetric binary trees.at n=8A083941
- a(n) = C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).at n=16A115567
- Number of permutations of length n which avoid the patterns 1324, 2314, 4312.at n=9A116757
- Numbers for which the sum of the digits is the square root of the product of their digits.at n=34A117720
- a(n) = number of partitions of d(n) into d(k)'s, where the k's are each <= n and distinct, but the d(k)'s need not be distinct. Here d(m) = the number of divisors of m.at n=47A175108
- Number of nX2 0,1 arrays with adjacent row and column sums unequal.at n=9A203604
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -2<=w+x+y<=2.at n=32A211616
- Number of conjugacy classes in Chevalley group G_2(q) as q runs through the prime powers.at n=40A225929
- Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=40A250756
- Row sums of the partition array for the products of the hook lengths numbers of Ferrers (or Young) diagrams A263003.at n=7A263004
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 213", based on the 5-celled von Neumann neighborhood.at n=6A270902
- Number of reducible ways to split 1, 2, 3, ..., 3n into n arithmetic progressions each with 3 terms: a(n) = A104429(n) - A202705(n).at n=9A279199
- Numbers which are twice a U(2,4) number but not the sum of two distinct U(2,4) numbers.at n=8A285882
- Ulam numbers u such that 5*u is also an Ulam number.at n=28A287613
- p-INVERT of (1,0,0,1,0,0,1,0,0,...), where p(S) = 1 - S - 2 S^2.at n=12A291035
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=4A317520
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=2A317522