10703
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 2737
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8280
- Möbius Function
- -1
- Radical
- 10703
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 192
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions satisfying (cn(0,5) <= cn(1,5) = cn(4,5)).at n=49A036809
- a(n) = (n^3 + 5*n + 18)/6.at n=42A060163
- Numbers n such that n and the n-th prime have the same digits.at n=35A074350
- Multiples of 11 with digit sum 11, with no zero digits in odd places.at n=14A083512
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,7). The p-th row (p>=1) contains a(i,p) for i=1 to 7*p-6, where a(i,p) satisfies Sum_{i=1..n} C(i+6,7)^p = 8 * C(n+7,8) * Sum_{i=1..7*p-6} a(i,p) * C(n-1,i-1)/(i+7).at n=12A087111
- Interpolate 0's between each pair of digits of n-th prime.at n=39A092909
- Indices of primes in sequence defined by A(0) = 69, A(n) = 10*A(n-1) - 11 for n > 0.at n=10A101536
- 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, 0), (-1, -1, 1), (-1, 1, -1), (-1, 1, 0), (1, 0, 0)}.at n=11A148052
- a(n) = 343*n - 273.at n=31A157369
- Arithmetic mean of primes on square intervals such that the mean is an integer.at n=16A161348
- Number of binary strings of length n with no substrings equal to 0000 0110 or 1011.at n=13A164440
- Number of numerical semigroups of multiplicity n and genus n+2.at n=40A180739
- Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=15A193045
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+x+y>0.at n=14A211545
- a(n) = (a(n-1) + a(n-4))/gcd(a(n-1), a(n-4)) with a(1) = a(2) = a(3) = a(4) = 1.at n=53A214652
- Numbers k such that sigma(triangular(k)) = sigma(k)^2.at n=7A232355
- Numbers k with the property that it is possible to write the base 2 expansion of k as concat(a_2,b_2), with a_2>0 and b_2>0 such that, converting a_2 and b_2 to base 10 as a and b, we have sigma(a + b) = sigma(k).at n=12A258843
- Number of digits of hyperfactorial(hyperfactorial(n)).at n=3A260262
- Growth series for affine Coxeter group (or affine Weyl group) D_8.at n=8A266763
- Numbers with digit sum 11 that are multiples of 11.at n=22A283742