10786
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16182
- Proper Divisor Sum (Aliquot Sum)
- 5396
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5392
- Möbius Function
- 1
- Radical
- 10786
- 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
- 68
- Smith Number
- yes
- 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
- Number of graphical basis partitions of 2n.at n=28A001130
- Number of connected regular graphs of degree 8 with n nodes.at n=13A014378
- Length of n-th term of A006711.at n=32A022476
- Convolution of composite numbers and (F(2), F(3), F(4), ...).at n=13A023649
- Number of 4-valent (or quartic) graphs with n nodes.at n=13A033301
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 3).at n=45A035535
- Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.at n=82A051031
- Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.at n=86A051031
- 10000n+1, 10000n+3, 10000n+7, 10000n+9 are all primes.at n=7A064963
- Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.at n=39A089447
- Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.at n=41A089447
- Expansion of Product_{k > 0} (1 + f(k)*x^k), where f(n) = A147952(n).at n=29A147953
- 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, 0, 0), (-1, 1, 1), (1, 0, -1), (1, 0, 1)}.at n=8A149294
- Values of register a when register b becomes 0 for the two-register machine {i[1], i[1], i[1], d[2,1], d[1,6], i[2], d[1,5], d[2,3]}.at n=19A156622
- Number of not necessarily connected 8-regular simple graphs on n vertices.at n=13A180260
- Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth exactly g.at n=4A184980
- Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth at least g.at n=4A184981
- Number of connected 8-regular simple graphs on n vertices with girth exactly 3.at n=13A184983
- Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth at least g.at n=13A185340
- Triangular array E(n,k) counting, not necessarily connected, k-regular simple graphs on n vertices with girth exactly 3.at n=86A185643