11932
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22120
- Proper Divisor Sum (Aliquot Sum)
- 10188
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5616
- Möbius Function
- 0
- Radical
- 5966
- Omega Function (Ω)
- 4
- 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
- 143
- 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
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=41A005892
- a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=3.at n=18A022308
- Expansion of 1/((1-x)(1-8x)(1-11x)(1-12x)).at n=3A025008
- a(n) = Sum_{k=0..floor(n/2)} A026615(n-k,k).at n=19A026625
- Number of consecutive integers placed in n bins under a certain packing scheme.at n=9A031506
- Multiplicity of highest weight (or singular) vectors associated with character chi_32 of Monster module.at n=41A034420
- Number of A095744-primes in range ]2^n,2^(n+1)].at n=21A095754
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=41A118312
- Multiples of 19 containing a 19 in their decimal representation.at n=20A121039
- a(n) = Fibonacci(n) mod n^3.at n=38A132636
- a(n) = 7*n^2 + 4*n + 1.at n=42A135704
- Has two properties: concatenation of its digits is same string as concatenation of digits of its first differences and every number appears exactly one of the sequence or its first differences.at n=37A139310
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,1 3,1 4,0 4,1 5,0 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155344
- Number of permutations of 1..n with all differences of elements separated by distances 1 through 4 being respectively unique.at n=11A170810
- G.f.: exp( Sum_{n>=1} A174466(n)*x^n/n ) where A174466(n) = Sum_{d|n} d*sigma(n/d)*tau(d).at n=15A174465
- Number of n X 3 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=3A201211
- Number of nX4 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=2A201212
- T(n,k)=Number of nXk 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=17A201216
- T(n,k)=Number of nXk 0..3 arrays with every row and column running average nondecreasing rightwards and downwards.at n=18A201216
- Number of n X 4 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 5 binary array having a sum of two or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=4A227261