11206
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 6938
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5160
- Möbius Function
- -1
- Radical
- 11206
- Omega Function (Ω)
- 3
- 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
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- T(n,n-4), array T as in A038792.at n=23A038794
- Numbers whose base-7 representation contains exactly four 4's.at n=21A043412
- Number of compositions of n such that two adjacent parts are not equal modulo 4.at n=19A062202
- Triangle T(n,k), read by rows, given by A000290 DELTA [1, 2, 6, 5, 11, 8, 16, 11, 21, 14, 26, 17, 31, 20, 36, ...] where DELTA is the operator defined in A084938.at n=19A088969
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=17A166537
- Number of strings of numbers x(i=1..n) in 0..6 with sum i*x(i)^3 equal to n*216.at n=8A184717
- a(n) = Sum_{k=1..n} F(n mod k) where F = A000045, the Fibonacci numbers.at n=39A198259
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 2)/(x + 1).at n=37A231732
- Number of 3 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=16A240395
- G.f.: Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k) * (1/(1-x)^k - 1)^k.at n=9A245465
- Total number of torsion-free congruence subgroups of PSL(2,Z) of genus n.at n=22A258696
- Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2.at n=2A264309
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2.at n=17A264313
- Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2.at n=3A264316
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n*b(n), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=13A296294
- Numbers k such that 453*2^k+1 is prime.at n=31A323196
- a(n) = Sum_{k=0..n} q(n,k) * !k, where q(n,k) = number of partitions of n into k distinct parts and !k = subfactorial of k.at n=29A331518
- a(n) is the number of vertices formed by n-secting the angles of a pentagon.at n=43A335554