10706
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16524
- Proper Divisor Sum (Aliquot Sum)
- 5818
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5200
- Möbius Function
- -1
- Radical
- 10706
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 47
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=17A033829
- a(n) = (5*n+1)*(5*n+6).at n=20A085025
- G.f. satisfies: A(x/A(x)) = 1 + x*A(x).at n=7A145345
- Number of n X n binary arrays with rows and columns, considered as binary numbers, in strictly increasing order.at n=4A162100
- Number of n X n binary arrays with rows and columns, considered as binary numbers, in strictly increasing order, and no more than 5 ones in any row or column.at n=4A162104
- Number of n X n binary arrays with rows and columns, considered as binary numbers, in strictly increasing order, and no more than 6 ones in any row or column.at n=4A162105
- Number of n X n binary arrays with rows and columns, considered as binary numbers, in strictly increasing order, and no more than 7 ones in any row or column.at n=4A162106
- Number of n X n binary arrays with rows and columns, considered as binary numbers, in strictly increasing order, and no more than 8 ones in any row or column.at n=4A162107
- Number of n X n binary arrays with rows and columns, considered as binary numbers, in strictly increasing order, and no more than 9 ones in any row or column.at n=4A162108
- a(n) = (9*n+2)*(9*n+7).at n=11A177072
- T(n,k)=number of nXk binary matrices with rows and columns in lexicographically strictly increasing order.at n=40A180984
- Number of 0..n arrays x(0..6) of 7 elements with zero 4th differences.at n=28A200274
- Number of partitions p of n such that (number of numbers in p of form 3k) > (number of numbers in p of form 3k+1).at n=42A241745
- Number of partitions of n with difference 6 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=36A242697
- Number of (n+1)X(2+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=2A253518
- Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=1A253519
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=7A253524
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=8A253524
- L.g.f.: Sum_{n>=1} x^((2*n-1)^2) / ( (2*n-1) * (1 - x^(2*n))^(2*n-1) ).at n=50A293598
- Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=5A299048