10628
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18606
- Proper Divisor Sum (Aliquot Sum)
- 7978
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5312
- Möbius Function
- 0
- Radical
- 5314
- Omega Function (Ω)
- 3
- 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
- 55
- 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
- Numbers k such that 45*2^k - 1 is prime.at n=50A002242
- Numbers k such that k^16 == 1 (mod 17^3).at n=36A056088
- k such that k-th prime is of the form 2n^2 + 3n + 3.at n=36A096690
- a(n) = the number of "isolated divisors" of n!. A positive divisor, k, of n is isolated if neither (k-1) nor (k+1) divides n.at n=16A133952
- Irregular triangle, T(n, k) = coefficients of p(x, n), where p(x, n) = (1-2*x)^(n+1) * Sum_{j>=0} j^n*(x/(1-x))^j, read by rows.at n=43A142073
- The initial decimal digits of 2^a(n) are the decimal digits of n followed by n.at n=21A171652
- a(n) = Sum_{d|n} d^phi(d).at n=9A174476
- Number of -1..1 arrays x(0..n+1) of n+2 elements with zero sum and nonzero second differences.at n=9A200546
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 2 X n array.at n=44A220154
- Limit of rows in triangle A232433 when read in reverse order.at n=13A232434
- Number of length 3 arrays x(i), i=1..3 with x(i) in i..i+n and no value appearing more than 2 times.at n=20A250352
- a(n) = Sum_{k|n} binomial(n-1,k-1).at n=24A271654
- Number of 2 X 2 matrices having entries in {-n,...,0,..,n} and permanent=trace with no entry repeated.at n=37A279018
- Triangle read by rows, T(n, k) = Sum_{j=0..n} (-1)^(k-j)*Eulerian1(n, j)* binomial(n-j, n-k) for 0 <= k <= n.at n=47A291977
- Numbers that are the sum of eight fourth powers in six or more ways.at n=31A345581
- Numbers that are the sum of nine fourth powers in eight or more ways.at n=31A345592
- Numbers that are the sum of eight fourth powers in exactly six ways.at n=24A345838
- Numbers that are the sum of nine fourth powers in exactly eight ways.at n=28A345850
- a(n) = Sum_{k=0..floor(n/2)} (k+1) * binomial(k,n-2*k)^2.at n=17A375218