11124
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29120
- Proper Divisor Sum (Aliquot Sum)
- 17996
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3672
- Möbius Function
- 0
- Radical
- 618
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- Fibonacci sequence beginning 2, 17.at n=15A022118
- Number of partitions of n into parts not of the form 15k, 15k+6 or 15k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=36A035960
- Convolution of A008549 with A000302 (powers of 4).at n=6A038806
- Numbers k such that sigma(k) = 2*usigma(k).at n=32A063880
- Numbers whose product of decimal digits equals its sum of binary digits.at n=17A064003
- Triangle, read by rows, where g.f. of row n equals the product of (1-x)^n and the g.f. of the coordination sequence for root lattice B_n, for n >= 0.at n=52A109001
- Matrix log of triangle A078122, which shifts columns left and up under matrix cube; these terms are the result of multiplying each element in row n and column k by (n-k)!.at n=30A111815
- a(n) = prime(n)*(prime(n+1) + 1).at n=26A123134
- Number of zeros in n-th even perfect number written in base 16.at n=26A161496
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=17A167519
- a(n) = n*(n+1)*(5*n^2 - n - 3)/2.at n=8A172118
- First of two consecutive numbers with at least one 3 in their prime signature.at n=55A176313
- Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x - x^2)/(1 - 3*x - 3*x^2).at n=7A180142
- Square array read by antidiagonals: T(m,n) is the number of L-convex polyominoes with m rows and n columns.at n=58A181370
- Square array read by antidiagonals: T(m,n) is the number of L-convex polyominoes with m rows and n columns.at n=62A181370
- Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/(2*sqrt(1-4x))).at n=30A188481
- Positions of primes within Dana Scott's sequence (A048736).at n=22A192242
- Numbers with digital product = 8.at n=36A199989
- Composite numbers whose product of digits is 8.at n=25A201056
- Number of (w,x,y) with all terms in {0,...,n} and w < R < 2*w, where R = range{w,x,y} = max(w,x,y)-min(w,x,y).at n=40A213400