5679
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8216
- Proper Divisor Sum (Aliquot Sum)
- 2537
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3780
- Möbius Function
- 0
- Radical
- 1893
- Omega Function (Ω)
- 3
- 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
- 160
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=51A011904
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=45A023180
- McKay-Thompson series of class 42b for Monster.at n=44A058676
- Sum of divisors of twice square numbers.at n=42A065765
- Fifth subdiagonal in array of n-gonal numbers A081422.at n=17A081436
- a(1) = 9, then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=13A083995
- Expansion of (1+x^3)/((1-x)^2*(1-x^3)^2).at n=51A092353
- a(n) is the number of positive integers <= 10^n that are divisible by no prime exceeding 3.at n=40A100752
- Starting with 1, each number is the previous number plus the product of the index number and the sum of the digits of the previous number.at n=27A113904
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=32A117807
- Start with 34 and repeatedly reverse the digits and add 16 to get the next term.at n=17A119454
- a(n) = Sum_{i=0..n} Sum_{j=0..n} (-1)^(i+j) * (i+j)!/(i!j!).at n=8A120305
- Number of crossing-optimal drawings of the complete graph K_n.at n=10A121021
- a(n) = 153*n + 18.at n=37A139618
- Number of compositions such that the number of parts is divisible by the first part.at n=13A168655
- G.f.: exp( Sum_{n>=1} A174468(n)*x^n/n ) where A174468(n) = Sum_{d|n} d*sigma(n/d)*sigma(d).at n=11A174467
- A126789 with zeros removed.at n=36A176623
- Smallest k>0 such that (3^n+k)*3^n-1 and (3^n+k)*3^n+1 are a twin prime pair.at n=46A214496
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of two or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=16A227259
- 0 followed by the sum of (1),(2), (3,4),(5,6), (7,8,9),(10,11,12) from the natural numbers.at n=35A235355