6940
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14616
- Proper Divisor Sum (Aliquot Sum)
- 7676
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2768
- Möbius Function
- 0
- Radical
- 3470
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 106
- 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
- McKay-Thompson series of class 5a for Monster.at n=24A007253
- Self-convolution of natural numbers >= 3.at n=29A023551
- Number of days in n years (n=3 is the first leap year).at n=18A033172
- Number of days in n years (n=2 is the first leap year).at n=18A033173
- Number of days in n years (n=1 is the first leap year).at n=18A033174
- Numbers which are the sum of their proper divisors containing the digit 3.at n=0A059462
- a(n) = Sum_{d|n} d*Fibonacci(n/d).at n=19A066769
- List of codewords in binary lexicode with Hamming distance 5 written as decimal numbers.at n=21A075931
- a(n) = Sum_{k=0..floor(n/4)} C(n-2k,2k) * 3^k * 2^(n-4k).at n=10A100133
- Sum of primes q with prime(n) < q < 2*prime(n).at n=38A108313
- Partial sums of the generalized Cuban primes A007645.at n=37A172113
- Number of line segments connecting exactly 6 points in an n x n grid of points.at n=26A177722
- a(n) = Sum_{d|n} phi(d^phi(d)).at n=11A179117
- Number of 6-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=8A187380
- Expansion of x^4*(2-3*x-x^2)/((1+x)*(1-2*x)^2).at n=15A219751
- Let sequence B_n={b_m} be defined by: b_1=prime(n), b_2=prime(n+1); for m>=3, b_m=b_(m-2)+b_(m-1) if b_(m-2)+b_(m-1) is not semiprime, otherwise b_m is the least prime divisor of b_(m-2)+b_(m-1). Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded.at n=39A221218
- Number A(n,k) of squares in all tilings of a k X n rectangle using integer-sided square tiles; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=60A226545
- Number of squares in all tilings of a 5 X n rectangle using integer-sided square tiles.at n=5A226548
- Number of squares in all tilings of an n X n square using integer-sided square tiles.at n=5A226554
- Partial sums of A014817.at n=38A227841