7014
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 9114
- 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
- 1992
- Möbius Function
- 1
- Radical
- 7014
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 57
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RTH = RUB-13 [B2Si30O64].2R starting with a T1 atom.at n=12A019226
- a(n) = n*(4*n-1).at n=42A033991
- Number of primes between n*100000 and (n+1)*100000.at n=16A038825
- a(n) = A028321(n)/2.at n=29A051473
- Least nontrivial multiple of the n-th prime beginning with 7.at n=38A078291
- Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.at n=11A087277
- Multiples of 14 containing a 14 in their decimal representation.at n=22A121034
- a(n) = 4*n^2 + 79*n + 390.at n=31A157434
- a(n) = 16*n^2 - 2*n.at n=20A158058
- a(n) = n*n in the arithmetic where when digits are to be added they are multiplied, and when they are to be multiplied they are added.at n=37A169921
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=41A178980
- Costas arrays such that the corresponding permutation is connected.at n=11A213339
- a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is an oblong number.at n=25A214963
- Numbers producing at least 4 primes by proper concatenation of decrements.at n=10A232657
- Number of compositions of n in which each part p has multiplicity p.at n=45A242434
- Triangle read by rows: T(m,n) is the Szeged index of the grid graph P_m X P_n (1 <= n <= m).at n=24A245826
- (16n^6 - 24n^5 + 2n^4 + 11n^3 - 6n^2 + n) / 6.at n=4A245941
- Squarefree kernel of A255334: a(n) = A007947(A255334(n)).at n=49A255424
- Number of (n+1)X(n+1) 0..1 arrays with each row and column prime, read as a binary number with top and left being the most significant bits.at n=4A261753
- Number of (n+1)X(5+1) 0..1 arrays with each row and column prime, read as a binary number with top and left being the most significant bits.at n=4A261758