12735
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
- 12
- Divisor Sum
- 22152
- Proper Divisor Sum (Aliquot Sum)
- 9417
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6768
- Möbius Function
- 0
- Radical
- 4245
- Omega Function (Ω)
- 4
- 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
- 94
- 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
- no
- Odd
- yes
Appears in sequences
- Generalized Catalan numbers: a(n+1) = a(n) + Sum_{k=1..n-1} a(k)*a(n-1-k).at n=14A004148
- Essentially same as A004148.at n=15A025241
- Number of partitions of n into parts not of the form 11k, 11k+5 or 11k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=41A035948
- a(n) = floor((1287/545)^n).at n=10A063636
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k peaks (n>=0, 0<=k<=floor(n/2)).at n=56A097860
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k valleys (n>=0, 0<=k<=floor(n/2)-1; a valley is a downstep followed by an upstep).at n=38A097885
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths in which the k-th step is the leftmost (1,0)-step (can be easily expressed using RNA secondary structure terminology).at n=56A098086
- Partial sums of quadruple factorial numbers n!!!! (A007662).at n=16A108895
- Integer part of Gauss's Arithmetic-Geometric Mean M(1,n^4).at n=17A127760
- Number of compositions of n with parts in N which avoid the consecutive pattern 123.at n=15A128761
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 00100-11111-00100 pattern in any orientation.at n=17A147009
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,-1)-returns to the horizontal axis. The members of L_n are paths of weight n that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=35A182896
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in F[n] having endpoint height k (k<=floor(n/2)). The members of F[n] are paths of weight n that start at (0,0), do not go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=49A182906
- Euler transform of the swinging factorial A056040.at n=11A190905
- Starting position of the first occurrence of a string of 2^n in the decimal expansion of Pi.at n=10A194351
- Number of elevated peakless Motzkin paths.at n=16A203019
- Indices of primes in sequence A108300.at n=13A228916
- Number of partitions of n with difference 6 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=37A242697
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation Sum_{k=0..n} x^k = Sum_{k=0..n} A_k*(x+2*(-1)^k)^k.at n=23A249266
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 107", based on the 5-celled von Neumann neighborhood.at n=26A270166