11992
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22500
- Proper Divisor Sum (Aliquot Sum)
- 10508
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5992
- Möbius Function
- 0
- Radical
- 2998
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 50
- 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
- Shapes of height-balanced AVL trees of height at most 5 with n nodes.at n=21A036662
- Numerators of continued fraction convergents to sqrt(438).at n=4A041834
- Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples p*q*r chosen from [1,3n].at n=8A072368
- Binomial transform of generalized Lucas numbers S(n) = S(n-1) + S(n-2) + S(n-3), S(0)=3, S(1)=1, S(2)=3.at n=9A073313
- Triangle read by rows: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2^n.at n=25A143897
- Partial sums of A018805.at n=37A177853
- Numbers k such that there are 2 primes between 100*k and 100*k + 99.at n=37A186394
- Triangle read by columns: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, k>=1, A029837(k)<=n<A072649(k).at n=25A217298
- Number of height minimal AVL trees with n (leaf-) nodes.at n=20A217299
- a(n) = spt(5n+4)/5 where spt(n) = A092269(n).at n=6A220505
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=42A232854
- a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process.at n=40A259013
- Least positive integer k such that prime(k) + prime(k*n) is a square.at n=55A259712
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 809", based on the 5-celled von Neumann neighborhood.at n=22A273612
- Number of n X 2 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=11A280155
- a(n) = a(n-1) + sum of base-1000 digits of a(n-1), a(0)=1.at n=38A292568
- Array read by antidiagonals upwards where A(n, k) is the number of non-isomorphic multiset partitions of weight n with k levels of brackets.at n=38A306186
- Number of non-isomorphic multiset partitions of multiset partitions of multisets of size n.at n=6A318566
- Total number of 1's in the binary expansion of parts in all partitions of n into distinct parts.at n=41A347060
- a(n) is the unique solution to A323410(x) = A362185(n).at n=20A362211