10776
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27000
- Proper Divisor Sum (Aliquot Sum)
- 16224
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3584
- Möbius Function
- 0
- Radical
- 2694
- Omega Function (Ω)
- 5
- 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
- 68
- 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 k and k^2 use only the digits 0, 1, 2, 6 and 7.at n=27A136828
- a(n) = 1728*n - 1320.at n=6A157263
- Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k UUDUDD's starting at level 0 (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)).at n=53A166295
- Number of (n+1)X(n+1) 0..1 arrays with the array of 2X2 subblock determinants symmetric.at n=2A187453
- T(n,k)=Number of (n+1)X(n+1) 0..k arrays with the array of 2X2 subblock determinants symmetric.at n=5A187457
- Number of (n+1)X(2+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=3A237009
- Number of (n+1)X(4+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=1A237011
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=11A237015
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=13A237015
- a(n) equals the constant term in the sum of all permutations of compositions of functions (1 + k*x) for k=1..n.at n=4A277405
- Expansion of 1/(1 - x*Product_{k>=1} (1 + x^k)^k).at n=11A299167
- a(n) = a(n-1) + p(n) if p(n) > a(n-1), otherwise a(n) = a(n-1) - p(n), where p is the partition function A000041 (assuming a(n) = 0 for n < 0).at n=40A331165
- Least positive integer m relatively prime to n such that sigma(m*n) is a fourth power, where sigma(k) is the sum of the divisors of k.at n=28A334353
- Numbers k such that the largest unitary divisor of sigma(k) that is coprime with A003961(k) is also a unitary divisor of k.at n=39A351551
- Triangle read by rows: T(n,k) is the number of simple graphs on n labeled nodes with k articulation vertices, (0 <= k <= n).at n=22A370065
- Expansion of e.g.f. 1/( exp(-x) - x )^4.at n=4A379943