7006
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10944
- Proper Divisor Sum (Aliquot Sum)
- 3938
- 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
- 3360
- Möbius Function
- -1
- Radical
- 7006
- 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
- 88
- 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
- Maximal planar degree sequences with n nodes.at n=13A007020
- Coordination sequence for FeS2-Marcasite, Fe position.at n=41A009955
- a(n) = floor(n*(n-1)*(n-2)/13).at n=46A011895
- Convolution of natural numbers >= 2 and natural numbers >= 3.at n=30A023545
- a(n) = diagonal sum of left justified array T given by A027113.at n=23A027131
- Expansion of Product(1+q^m)^(m(m-1)/2); m=1..inf.at n=15A027999
- Numbers whose set of base-15 digits is {1,2}.at n=24A032935
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 4).at n=53A046768
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.at n=31A051869
- Numbers n such that sigma(n+1)-sigma(n) = -sigma(n)/d(n), where d(n) denotes the number of divisors of n.at n=2A066177
- 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, 0), (-1, 0, 1), (-1, 1, -1), (1, -1, 0), (1, 0, 1)}.at n=9A148611
- 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, 0, 1), (-1, 1, -1), (1, -1, 0), (1, 0, 1)}.at n=9A148612
- 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, 0), (-1, 0, 0), (0, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150461
- Number of (n+4)X(n+4) 0..1 matrices with each 5X5 subblock idempotent.at n=7A224682
- Number of partitions of n such that the multiplicity of 2*(number of parts) is a part.at n=54A240500
- a(n) = Fibonacci(n) + n*Lucas(n).at n=13A258321
- Sum of divisors of the products of the smaller and larger parts of the partitions of n into two parts.at n=33A270528
- T(n,k)=Number of nXk 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=37A281563
- Number of 2Xn 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=7A281564
- Numbers k such that (49*10^k + 311)/9 is prime.at n=19A282140