6986
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
- 12000
- Proper Divisor Sum (Aliquot Sum)
- 5014
- 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
- 2988
- Möbius Function
- -1
- Radical
- 6986
- 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
- 150
- 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 labeled nonseparable bipartite graphs on n nodes.at n=6A004100
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=28A024599
- a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2).at n=25A026037
- Incrementally largest terms in continued fraction for Copeland-Erdős constant.at n=10A033310
- Number of partitions in parts not of the form 23k, 23k+1 or 23k-1. Also number of partitions with no part of size 1 and differences between parts at distance 10 are greater than 1.at n=40A035989
- a(n) = Sum_{i=0..n} A047130(i, n-i).at n=14A047131
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.at n=25A051401
- Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321.at n=25A051402
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.at n=15A056132
- An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n.at n=26A060434
- Expansion of 1 / Product_{n>=0} (1 - q^(5n+1))*(1 - q^(5n+3))*(1 - q^(5n+4)).at n=48A107236
- Number of partitions of n such that the set of parts and the set of multiplicities of parts are disjoint.at n=47A114639
- Let T(S,Q) be the sequence obtaining by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1016,5), the first S for which T(S,5) reaches a cycle of length 36.at n=33A118879
- Row sums of triangular array T: T(j,k) = k*(j-k)! for k < j, T(j,k) = 1 for k = j; 1 <= k <= j.at n=7A129867
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=7A150267
- A sequence of triples of squarefree consecutive integers each composed of exactly three primes.at n=34A165936
- n-th prime*8-7 is the square of a prime.at n=33A169583
- (1,[99n+1]) Pascal Triangle.at n=41A172179
- Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others.at n=29A183898
- The number of unlabeled graphs on n nodes with degree of 1 or 2.at n=27A186417