6708
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 17248
- Proper Divisor Sum (Aliquot Sum)
- 10540
- 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
- 2016
- Möbius Function
- 0
- Radical
- 3354
- Omega Function (Ω)
- 5
- 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
- 44
- 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
- Moebius transform of Fibonacci numbers.at n=19A007436
- a(n) = (d(n)-r(n))/2, where d = A026046 and r is the periodic sequence with fundamental period (0,1,0,1).at n=30A026047
- a(n) = (2*n+1)*(9*n+1).at n=19A033573
- Expansion of sum ( q^n / product( 1-q^k, k=1..4*n), n=0..inf ).at n=26A035296
- 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2.at n=39A051682
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,7.at n=11A064240
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,9.at n=12A064241
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,21.at n=15A064247
- a(n) = 3*n^3 + n^2 - 4*n.at n=13A083127
- Expansion of psi(x^3)^2 / f(-x^2) in powers of x where psi(), f() are Ramanujan theta functions.at n=53A097196
- k's first occurrence in A102932.at n=48A101255
- The first 8 values are predefined, the remaining set to a(n) = 48*prime(n)+n+2.at n=33A129025
- Exponentiation of A132841.at n=25A132842
- a(n) = Sum_{k=1..n} k*sigma(k).at n=22A143128
- a(n) = 216*n + 12.at n=30A154519
- Numbers k such that k^3 +-5 are primes.at n=31A176684
- a(n) = 4*A060819(n-2)*A060819(n+2).at n=43A181829
- Number of ways to place 3 nonattacking grasshoppers on a toroidal chessboard of size n x n.at n=5A190398
- Number of nX4 0..2 arrays with no more than floor(nX4/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=4A223470
- Number of nX5 0..2 arrays with no more than floor(nX5/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=3A223471