14256
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 50
- Divisor Sum
- 45012
- Proper Divisor Sum (Aliquot Sum)
- 30756
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 66
- Omega Function (Ω)
- 9
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=2 and a(2)=a(3)=1.at n=14A024735
- T(n,0) + T(n,1) + ... + T(n,n), T given by A026681.at n=12A026688
- Number of words of length 4 in the n(n-1)/2 transpositions of S[ n ] equivalent to the identity.at n=11A029699
- Numbers k such that 205*2^k+1 is prime.at n=15A032479
- Numbers having four 0's in base 6.at n=29A043372
- Triangle with n >= k >= 0 where a(n,k) = 2^k*3^(n-k)*(C(n+1,0)+C(n+1,1)+...C(n+1,k)).at n=25A061929
- Triangle with columns built from certain power sequences.at n=41A067402
- Sixth column of triangle A067402.at n=3A067406
- Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=21A070980
- Numbers whose product of exponents is equal to the sum of prime factors.at n=22A071175
- GCD of n! and the reverse of n!.at n=25A071678
- a(1) = 4; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.at n=3A077700
- 6th binomial transform of (1,1,0,0,0,0,...).at n=5A081106
- Triangle, read by rows, such that the diagonal (A084785) is the self-convolution of the first column (A084784) and the row sums (A084786) gives the differences of the diagonal and the first column.at n=33A084783
- Numbers divisible by twice the sum of the products of each of their digits, excluding even multiples of 10.at n=36A085446
- Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the natural numbers, with T(0,k) = (k+1) for k>=0.at n=60A089944
- Main diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.at n=5A089945
- a(n) = n(n-1)(n-3)(n-6)...(n-t), where t is the largest triangular number less than n; number of factors in the product is ceiling((sqrt(1+8*n)-1)/2).at n=11A094261
- a(n) = 6^(n-1)*J(n), where J(n) = A001045(n).at n=5A099138
- Denominators of e.g.f. cosec(arctanh(x)).at n=39A102077