14568
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 36480
- Proper Divisor Sum (Aliquot Sum)
- 21912
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4848
- Möbius Function
- 0
- Radical
- 3642
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- From the game of Mousetrap.at n=8A018934
- Number of nondecreasing integer sequences of length 7 with sum zero and sum of absolute values 2n.at n=21A158141
- Triangle read by rows: T(n,k) is the number of non-derangements of {1,2,...,n} for which the difference between the largest and smallest fixed points is k (n>=1; 0 <= k <= n-1).at n=39A161129
- Number of (w,x,y) with all terms in {0,...,n} and w <= x + y and x < y.at n=32A212981
- Number of (w,x,y) with all terms in {0,...,n} and w != max(|w-x|,|x-y|,|y-w|).at n=24A213498
- Triangle read by rows: T(n, k) = Sum_{t=k..n-2} (-1)^(t-k)*(n-t)!*binomial(t,k)*binomial(n-2,t).at n=22A264027
- p-INVERT of (0,0,1,2,3,5,8,...), the Fibonacci numbers preceded by two zeros, where p(S) = 1 - S - S^2.at n=17A289976
- Number of nXn 0..1 arrays with every element unequal to 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A316635
- Number of nX5 0..1 arrays with every element unequal to 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A316638
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=40A316641
- Expansion of Product_{k>=1} (1 - x^k)/(1 - k*x^k).at n=19A319756
- Expansion of (theta_3(z)*theta_3(23z) + theta_2(z)*theta_2(23z))^6.at n=13A328094
- a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * k!! * a(n-k).at n=6A335848
- Binary encoding of balanced ordered rooted trees (counted by A007059).at n=43A358524
- Number of integer compositions of n whose leaders of weakly decreasing runs are distinct.at n=16A374743
- Array A(T,k) read down antidiagonals: Number of typed decorated trees of cardinality T on k vertices with D=2 decorations.at n=23A384867
- a(n) = Sum_{k=0..n} binomial(n,k) * binomial(3*k,n-k).at n=7A387358