11132
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
- 18
- Divisor Sum
- 22344
- Proper Divisor Sum (Aliquot Sum)
- 11212
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4840
- Möbius Function
- 0
- Radical
- 506
- Omega Function (Ω)
- 5
- 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
- 117
- 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
- a(n) = n^2*(n+1).at n=22A011379
- a(n) = (d(n)-r(n))/5, where d = A026040 and r is the periodic sequence with fundamental period (4,0,4,3,4).at n=52A026042
- Number of partitions of n that do not contain 3 as a part.at n=38A027337
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 23 (most significant digit on left).at n=21A029468
- Composite numbers k such that digits in k and in juxtaposition of prime factors of k are the same (apart from multiplicity).at n=19A035141
- Positive numbers having the same set of digits in base 6 and base 10.at n=27A037437
- Number of noncrossing connected graphs with nodes on a circle having n edges.at n=6A065065
- Number of decimal digits of A070177(n).at n=8A077644
- Orchard crossing number of complete bipartite graph K_{1,n}.at n=45A080838
- a(n) = A000252(n) / A065558(n).at n=22A082965
- a(1) = 1; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.at n=3A088760
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in the center.at n=18A089474
- G.f. satisfies A(x) = 1 + x*A(x)*A(x^2)*A(x^3)*...*A(x^n)*...at n=16A091865
- A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fifth power for every i.at n=39A096906
- a(n) = n^2*(n+1)*(2*n+1)/3.at n=10A098077
- List of Lyndon words on {1,2,3} sorted first by length and then lexicographically.at n=36A102660
- Series expansion for first area weighted moment of neighbor-avoiding polygons on square lattice.at n=7A121772
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 4 and 9.at n=13A136972
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, -1), (0, 1, 0), (1, 0, 0)}.at n=8A149965
- Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^4 = I.at n=3A163171