10982
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18420
- Proper Divisor Sum (Aliquot Sum)
- 7438
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 646
- 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
- 42
- 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
- Number of permutations of order n with the length of longest run equal to 4.at n=7A001252
- Triangle read by rows: number of permutations of 1..n by length of longest run.at n=25A010026
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=66A011907
- Expansion of 1/((1-x)(1-7x)(1-11x)(1-12x)).at n=3A024446
- Numbers n such that n | sigma_12(n).at n=19A055716
- Number of meaningful differential operations of the n-th order on the space R^9.at n=11A090994
- Sum of the smallest and the largest n-digit primes.at n=3A104224
- Generator for the finite sequence A053016.at n=33A136254
- Numbers n such that n^4 is a sum of 4th powers of four nonzero integers whose sum is n.at n=1A138760
- Number of binary strings of length n with equal numbers of 0000 and 0110 substrings.at n=15A164151
- Diagonal sums of A167749.at n=17A167751
- Number of ways to place 4 nonattacking nightriders on a 4 X n board.at n=7A172219
- Partial sums of A006567.at n=29A172463
- G.f. satisfies: A(x) = Sum_{n>=0} x^n*A(x)^binomial(n+5,6).at n=6A191812
- Product of Fibonacci and Motzkin numbers: a(n) = A000045(n+1)*A001006(n).at n=8A200539
- Triangle read by rows: number of permutations of 1..n by length l of longest run (n >= 1, 1 <= l <= n).at n=31A211318
- Least k such that the sum of the semiprime divisors equals n times the sum of the prime divisors, or 0 if no such k exists.at n=16A227419
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood.at n=28A271010
- Number of nX7 0..1 arrays with every element equal to 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=3A301998
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=48A301999