6992
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 7888
- 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
- 3168
- Möbius Function
- 0
- Radical
- 874
- Omega Function (Ω)
- 6
- 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
- 119
- 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
- Number of collinear point-triples in an n X n grid.at n=10A000938
- a(1) = 1; thereafter a(n+1) = floor(sqrt(2*a(n)*(a(n)+1))).at n=24A001521
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=23A020445
- Numbers k such that k^2 is palindromic in base 15.at n=41A030073
- Numbers whose set of base-15 digits is {1,2}.at n=23A032935
- Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=40A035544
- Number of partitions of 2n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=20A035594
- Numbers k such that 2047*2^k+1 is prime.at n=13A037177
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.at n=3A063055
- 2n*binomial(2n,n) - 4^n.at n=6A068552
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives sum of n-th group.at n=8A074124
- Indices of primes in sequence defined by A(0) = 97, A(n) = 10*A(n-1) - 33 for n > 0.at n=21A101005
- Numbers which are the sum of three cubes of distinct primes.at n=31A138854
- a(n) = n*(3*n+14).at n=46A140679
- Arises in enumerating non-degenerate colorings in Brook's Theorem.at n=7A152390
- Concatenation of odd n and even n-th nonprime.at n=23A155486
- Number of n X 3 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=10A201348
- Triangular array read by rows. T(n,k) is the number of ternary length-n words in which the longest run of consecutive 0's is exactly k; n>=0, 0<=k<=n.at n=47A209240
- Second column of A218869.at n=12A218871
- Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=17A229422