6698
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10692
- Proper Divisor Sum (Aliquot Sum)
- 3994
- 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
- 3136
- Möbius Function
- -1
- Radical
- 6698
- Omega Function (Ω)
- 3
- 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
- 44
- 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 partitions of 3n into n parts from the set {0, 1, ..., 6} (repetitions admissible).at n=21A001977
- Number of partitions of n into parts >= 4.at n=56A008484
- Inverse binomial transform of Thue-Morse sequence A001285.at n=17A029880
- Number of partitions of n such that cn(1,5) <= cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5).at n=71A036849
- Composite numbers not ending in zero that yield a prime when turned upside down.at n=39A048889
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=32A049779
- E.g.f.: 1/(1+log(1-x))-log(1-x).at n=6A052835
- Numbers of the form (10*a + b)^2 + (10*b + a)^2 with a and b less than 10, in numerical order.at n=30A061191
- a(n+1) = 2*a(n-2) + a(n-1), with a(0) = 3, a(1) = 0, and a(2) = 2.at n=21A072328
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=18A077405
- Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the edge.at n=31A098498
- Expansion of g.f. Product_{k>=1} 1/(1-x^sigma(k)).at n=45A111865
- Lengths of the loop of the sequences "Sum of last n digits" beginning with (n-1) zeros followed by digit 3.at n=14A112549
- Lengths of the loop of the sequences "Sum of last n digits" beginning with (n-1) zeros followed by digit 5.at n=14A112584
- Lengths of the loop of the sequences "Sum of last n digits" beginning with (n-1) zeros followed by digit 6.at n=14A112585
- Lengths of the loop of the sequences "Sum of last n digits" beginning with (n-1) zeros followed by digit 7.at n=14A112586
- Lengths of the loop of the sequences "Sum of last n digits" beginning with (n-1) zeros followed by digit 9.at n=14A112590
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=40A118156
- Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UDDU's.at n=27A135306
- a(n) integers with digit sum a(n); a(n+1) is the smallest integer > a(n).at n=36A136317