10476
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 27440
- Proper Divisor Sum (Aliquot Sum)
- 16964
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 582
- Omega Function (Ω)
- 6
- 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
- 104
- 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) = a(n-1)*(1 + a(n-1) - a(n-2)), a(0) = 0, a(1) = 1.at n=6A001696
- Number of 2's in n-th term of A022482.at n=34A022485
- Alternately add and multiply.at n=12A039941
- Row sums of triangle A049326.at n=5A049350
- Number of primitive (aperiodic) reversible string structures with n beads using a maximum of six different colors.at n=8A056335
- Numbers k such that sigma(k) = 2*usigma(k).at n=30A063880
- Triangle read by rows: T(n,k) (n >= 2, 1<=k<=n-1) is the number of permutations p of 1,...,n with max(|p(i)-p(i-1)|, i=2..n) = k.at n=25A064482
- Numbers k such that phi(k) = bigomega(k)*tau(k)^2.at n=24A068540
- Third column (k=5) of array A078741 ((3,3)-Stirling2) divided by 9.at n=2A089518
- Duplicate of A039941.at n=12A104700
- Triangle read by rows: numbers of isomers of unbranched a-4-catapolyheptagons.at n=49A120653
- Numbers of isomers of unbranched a-4-catapolyheptagons - see Brunvoll reference for precise definition.at n=5A121141
- a(n) = a(n-1) + a(n-2) if n == 3 mod 4; a(n) = a(n-1) - a(n-2) if n == 0 mod 4; a(n) = a(n-1)*a(n-2) if n == 1 mod 4; and a(n) = a(n-1)/a(n-2) if n == 2 mod 4; with a(1)=a(2)=1.at n=18A131183
- a(n) = a(n-1) + a(n-2) if n == 3 mod 4; a(n) = a(n-1) - a(n-2) if n == 0 mod 4; a(n) = a(n-1)*a(n-2) if n == 1 mod 4; and a(n) = a(n-1)/a(n-2) if n == 2 mod 4; with a(1)=a(2)=1.at n=21A131183
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n with k cells in the second row (0<=k<=n-1; a deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column).at n=33A134436
- a(n) = n*(8*n+3).at n=36A139276
- G.f.: A(x) = exp( Sum_{n>=1} (1 + sigma(n)*x)^n * x^n/n ).at n=9A159308
- Number of nX5 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.at n=5A164757
- Number of strong fixed blocks in all the permutations of [n] (see first comment for definition).at n=8A186374
- Binomial convolution of the Floor-Sqrt transform of Catalan numbers.at n=9A192653