10682
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
- 12
- Divisor Sum
- 18810
- Proper Divisor Sum (Aliquot Sum)
- 8128
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4536
- Möbius Function
- 0
- Radical
- 1526
- Omega Function (Ω)
- 4
- 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
- 148
- 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
- Expansion of 1/((1-x)(1-9x)(1-10x)(1-11x)).at n=3A025009
- Number of chiral pairs of asymmetric dissectable polyhedra with n tetrahedral cells (type A).at n=9A047776
- Numbers k such that 30*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=15A056680
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.at n=35A072607
- Numbers n such that sum k/d(k) is an integer, where d(k) is the k-th divisor of n (the divisors of n are in increasing order).at n=7A073082
- Partial sums of A079062.at n=28A177455
- Number of strings of numbers x(i=1..n) in 0..n with sum i*x(i)^4 equal to n^5.at n=8A184840
- Expansion of 2*x^2 *(4 +7*x +5*x^2 -x^3 -4*x^4 +6*x^6 +4*x^7 -x^8 -2*x^9) / ((1+x)^2 *(1+x+x^2)^2 *(1-x)^4) .at n=39A187062
- Stack polyominoes with square core.at n=41A188674
- Number of n X n 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=2A208401
- Number of n X 3 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=2A208403
- T(n,k) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=12A208408
- Number of 3 X n 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=2A208410
- Beach-Williams Pell numbers of type 2pq (p,q primes).at n=0A212075
- Numbers n such that sigma(n) - n = perfect number (A000396).at n=6A237286
- Triangle read by rows: TR(m,n) is the Wiener index of the hexagonal trapezium T(m,n), defined in the He et al. reference (1 <= n <= m).at n=37A248095
- Number of (not necessarily maximal) cliques in the n X n antelope graph.at n=48A308600
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A317149
- Number of n X 6 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A317151
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=39A317153