7002
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15210
- Proper Divisor Sum (Aliquot Sum)
- 8208
- 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
- 2328
- Möbius Function
- 0
- Radical
- 2334
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 31
- 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
- Some permutation of digits is a factorial number.at n=47A007926
- Some nontrivial permutation of digits is a factorial number.at n=40A007927
- Coordination sequence for A_5 lattice.at n=5A008385
- Numbers that are unchanged when turned upside down, when written in a font in which 7 looks like upside-down 2.at n=48A051791
- Number of ways to place 4 nonattacking queens on an n X n board.at n=7A061994
- Least positive integer coefficients of power series A(x) such that the coefficients of A(x)^2 + A(x) - 1 consist entirely of squares.at n=61A083352
- Multiples of 3 in which there is no common digit in successive terms.at n=24A083491
- Multiples of 9 in which there is no common digit in successive terms.at n=23A083497
- a(n) is the number of terms in the expansion of (x+y-z)*(x^2+y^2-z^2)*(x^3+y^3-z^3)*...*(x^n+y^n-z^n).at n=14A086817
- Square array T(n,k) (n >= 1, k >= 0) read by antidiagonals: coordination sequence for root lattice A_n.at n=50A103881
- a(n) = Sum_{i=0..n} C(n+1,i)*C(n-1,i-1)*C(2n-i,n).at n=5A103882
- a(0)=1, a(1)=2, a(2)=3, a(3)=5, a(4)=7, a(5)=10; a(n) = floor(a(n-1) + 1 + a(n-2)/6) for n>=6.at n=51A119565
- a(1) = 1; thereafter, a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any three consecutive digits in the sequence sum up to a prime.at n=40A152603
- Number of integer sequences of length n+1 with sum zero and sum of absolute values 10.at n=4A157054
- Number of nondecreasing integer sequences of length 8 with sum zero and sum of absolute values 2n.at n=15A158142
- a(1)=1, a(2)=2. Take terms a(n-1) and a(n-2), then convert to binary. Concatenate them, with either binary a(n-1) on the left and a(n-2) on the right, or with a(n-1) on the right and a(n-2) on the left such that the value of the resulting binary number is maximized. a(n) = the decimal equivalent of the resulting binary number.at n=5A162438
- Number of permutations of 5 copies of 1..n with all adjacent differences <= 1 in absolute value.at n=3A177301
- a(n) = (11*n^2 - 7*n)/2.at n=36A180223
- Monotonic ordering of set S generated by these rules: if x and y are in S then floor(x*y/2) is in S, and 5 is in S.at n=23A192520
- Number of partitions into distinct parts without three consecutive parts.at n=59A227426