11860
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24948
- Proper Divisor Sum (Aliquot Sum)
- 13088
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4736
- Möbius Function
- 0
- Radical
- 5930
- 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
- 50
- 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 the continued fraction for sqrt(k) has period 82.at n=37A020421
- a(n) = Sum_{k=0..n-2} T(n,k)*T(n,k+2), T given by A026736.at n=6A027217
- Number of binary [ n,4 ] codes of dimension <= 4 without zero columns.at n=15A034338
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 4).at n=45A035545
- Numbers k such that 267*2^k-1 is prime.at n=36A050892
- Number of ways to place 3 nonattacking kings on an n X n board.at n=7A061996
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square array such that all positions are mutually isolated. Two positions (s,t),(u,v) are considered as isolated from each other if min(abs(s-u),abs(t-v))>1.at n=23A098487
- a(n) = 8*n^2 + 8*n + 4.at n=38A108099
- Abs(*+-) n Sequence.at n=47A119518
- a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n).at n=38A128215
- 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, 1, 0), (1, 1, 1)}.at n=7A150907
- Numbers n such that there is no square n-gonal number greater than 1.at n=19A188896
- Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board.at n=38A193580
- Number of 0..n arrays x(0..9) of 10 elements with zero 5th differences.at n=34A200446
- G.f.: exp( Sum_{n>=1} (x^n/n) * Product_{d|n} (1 + n*x^d/d) ).at n=24A205476
- Number of (w,x,y) with all terms in {0,...,n} and the numbers w,x,y,|w-x|,|x-y| not distinct.at n=35A213491
- Principal diagonal of the convolution array A213783.at n=39A213759
- p-INVERT of the positive integers, where p(S) = (1 - S^2)(1 - 2*S^2).at n=8A290930
- G.f.: Product_{m>0} (1+x^m+2!*x^(2*m)).at n=37A293204
- Sum of the largest parts in the partitions of n into 7 squarefree parts.at n=43A308960