10762
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16146
- Proper Divisor Sum (Aliquot Sum)
- 5384
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5380
- Möbius Function
- 1
- Radical
- 10762
- Omega Function (Ω)
- 2
- 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
- 117
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for MgZn2, Mg position.at n=26A009939
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=37A031419
- Row 3 of square array defined in A047671.at n=17A047672
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=33A050036
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=33A050052
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=33A050068
- Triangle of the sum of squared coefficients of q in the q-binomial coefficients, read by rows.at n=71A125806
- Triangle of the sum of squared coefficients of q in the q-binomial coefficients, read by rows.at n=72A125806
- Central terms of odd-indexed rows of triangle A125806: a(n) = A125806(2n+1,n).at n=5A125807
- A106486-encodings of combinatorial games with value -1.at n=29A125993
- Number of lines through at least 2 points of a 6 X n grid of points.at n=36A160846
- G.f.: A(q) = exp( Sum_{n>=1} A002129(n) * 2*A006519(n) * q^n/n ).at n=36A161800
- G.f. is Q_0(q) where Q_0(q^4) is a series quadrisection of the g.f. of A161800.at n=9A161801
- A156977/3.at n=1A164565
- A(x) satisfies: Fibonacci(x)/x = A(x)/A(x^2).at n=18A173285
- Least m>0 such that prime(n) divides S(m)=A007908(m)=123...m and all numbers obtained by cyclic permutations of its digits; 0 if no such m exists.at n=32A181373
- Number of (n+1)X(n+1) -9..9 symmetric matrices with every 2X2 subblock having sum zero and two or three distinct values.at n=5A211552
- Number of (w,x,y,z) with all terms in {1,...,n} and w^2>x*y*z.at n=16A212066
- Number of n X 6 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 n X 6 array.at n=2A220202
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array.at n=30A220204