10686
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
- 23184
- Proper Divisor Sum (Aliquot Sum)
- 12498
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3264
- Möbius Function
- 1
- Radical
- 10686
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- Number of bipartite partitions.at n=16A002766
- McKay-Thompson series of class 42a for Monster.at n=49A058675
- Non-palindromic number and its reversal are both multiples of 13.at n=38A062912
- Numbers n such that there are exactly 4 primes p such that floor(n*log(n))+1<=p<=floor((n+1)*log(n+1))-1.at n=1A068362
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=26A074302
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives x's for indecomposable Wallis pairs with x < y (ordered by values of x).at n=25A075768
- a(n) = 7*n^2 + n.at n=39A092277
- Triangle T(n,k) of the number of unlabeled graphs on n nodes with universal reconstruction number k, 3<=k<=n. URN(G) is the minimum size for which all multisubsets of vertex-deleted subgraphs of G can uniquely reconstruct G up to isomorphism.at n=31A124003
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=30A153747
- a(n) = n^3 mod (n-th prime squared).at n=43A167623
- Record (maximal) gaps between prime triples (p, p+4, p+6).at n=24A201596
- Number of n X 1 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column, diagonal or antidiagonal.at n=6A207276
- Number of nX7 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column, diagonal or antidiagonal.at n=0A207282
- T(n,k)=Number of nXk 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column, diagonal or antidiagonal.at n=21A207283
- T(n,k)=Number of nXk 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column, diagonal or antidiagonal.at n=27A207283
- Number of nX7 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column or nw-se diagonal.at n=0A207478
- T(n,k)=Number of nXk 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column or nw-se diagonal.at n=21A207479
- T(n,k)=Number of nXk 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column or nw-se diagonal.at n=27A207479
- Number of nX7 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row or column.at n=0A207534
- T(n,k)=Number of nXk 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row or column.at n=21A207535