13211
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14424
- Proper Divisor Sum (Aliquot Sum)
- 1213
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12000
- Möbius Function
- 1
- Radical
- 13211
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 76
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- n written efficiently in natural numbers base, i.e., in form ...wxyz where n = 1*z + 2*y + 3*x + 4*w + ... with z <= 1, y < 2, x < 3, w < 4, ...at n=25A055611
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n.at n=14A057244
- Nearest integer to log(n!)^(1 + log(log(1 + n))).at n=28A062476
- Numbers divisible by the sum of factorials of their digits [A061602(n)] and also terminate in the sum of factorials of their digits.at n=14A071064
- The zero-free, right-to-left factorial walk encoding for each rooted plane tree encoded by A014486. Sequence A071155 shown with factorial expansion (A007623).at n=33A071157
- Factorial expansion of A071156.at n=32A071158
- Sequence A085188 shown in factorial base. (The longest prefix which can be shown with digits < 10.)at n=37A085187
- Numerator of Euler(n, 9/29).at n=3A157382
- This sequence is a relative of the audioactive sequences. We generate it by starting with a symbol * and describe sequentially: *, 1*, 111*, 311*, 13211*,...at n=3A171773
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=5, k=-2 and l=0.at n=7A177118
- Composite numbers whose product of digits is 6.at n=29A201055
- Second elementary symmetric function of the first n terms of (2,2,3,3,4,4,5,5...).at n=21A203299
- Nonprime numbers with all divisors starting and ending with digit 1.at n=17A208261
- After the 51-digit 2^168, a(n) is the number setting a record for non-pandigital right segment length of 2^a(n).at n=7A217608
- Numbers that eventually reach 1 under "x -> sum of 4th power of digits of x".at n=16A219111
- Number of partitions of n such that 2*(greatest part) < (number of parts).at n=44A237751
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00001011.at n=15A261551
- Erroneous duplicate of A171773.at n=3A271312
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 525", based on the 5-celled von Neumann neighborhood.at n=23A272740
- Irregular triangle T(n,k) read by rows: The number of tilings of the n X n board by 1 X 1 and k 3 X 3 squares, n >= 0, k >= 0.at n=28A276171