11226
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 11238
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3740
- Möbius Function
- -1
- Radical
- 11226
- 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
- 130
- 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
- Number of integer points (x,y,z) at distance <= 0.5 from sphere of radius n.at n=30A016728
- a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=20A022863
- dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).at n=30A026063
- Fourth-from-right diagonal of triangle A121207.at n=7A045499
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=38A109730
- Triangle read by rows. The definition is by diagonals. The r-th diagonal from the right, for r >= 0, is given by b(0) = b(1) = 1; b(n+1) = Sum_{k=0..n} binomial(n+2,k+r)*a(k).at n=62A121207
- Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the size of the last block is k, 1<=k<=n; the blocks are ordered with increasing least elements.at n=47A124496
- Numbers k such that A024528(k) is prime.at n=17A125707
- Triangle read by rows, (1 / ((-1)*A129184 * A007318 + I)) - I, I = Identity matrix.at n=48A160185
- Number of partitions of the set {1,2,...,n} such that no block is a sequence of consecutive integers (including 1-element blocks).at n=10A168444
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks (0 <= k <= n). An adjacent block is a block of the form (i, i+1, i+2, ...).at n=55A177254
- Eigentriangle of the binomial matrix.at n=58A186020
- Row sums of A186430.at n=12A186431
- Principal diagonal of the convolution array A213781.at n=30A213782
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X 2 array.at n=24A219211
- Convolution of A006068 (inverse of Gray code) with itself: a(n) = Sum_{k=1..n+1} A006068(k) * A006068(1+n-k).at n=36A268721
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=26A271150
- a(n) = (9*n^2 - n)/2 + 1.at n=50A276819
- Ulam numbers k such that k/3 is also an Ulam number.at n=22A287212
- Number of integers in base n having exactly three distinct digits such that the number formed by the consecutive subsequence of the initial j digits is divisible by j for all j in {1,2,3}.at n=42A333405