6994
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11340
- Proper Divisor Sum (Aliquot Sum)
- 4346
- 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
- 3216
- Möbius Function
- -1
- Radical
- 6994
- 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
- 106
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 9.at n=37A010339
- DIK(b)-DIK[ 2 ](b)-b where b is A035082.at n=15A035083
- a()=A037260 and its first [ A037261 ], 2nd [ A037262 ] and 3rd [ A037263 ] differences together include every number at most once and are monotonic and minimal.at n=16A037260
- T(n,n-2), array T as in A047140.at n=7A047144
- Coefficients of replicable function number "32b".at n=33A058632
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=21A060879
- a(n) = floor(sin(n)*cos(2*n)^2*tan(4*n)^3).at n=63A062233
- Octo numbers (a polygonal sequence): a(n) = 5*n^2 - 6*n + 2 = (n-1)^2 + (2*n-1)^2.at n=37A079273
- A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fifth power for every i.at n=26A096906
- 3-almost primes with semiprime digits (digits 4, 6, 9 only).at n=21A111494
- a(n)=ceiling( sum_{i=1..n-1} a(i)/6), a(1)=1.at n=61A120178
- Nonprime integers n such that n divides A120492(n).at n=27A120329
- Ulam's spiral (NNE spoke).at n=21A143861
- 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, -1), (0, 1, 1), (1, -1, 1)}.at n=8A148913
- Numbers m such that A006218(m) is a perfect square.at n=27A175345
- 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=38A178980
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..2*n such that x(j) divides x(k) if j divides k.at n=31A180384
- Number of right triangles on an (n+1) X 5 grid.at n=14A189809
- Numbers n such that n!8-1 is prime.at n=48A204662
- Sum_{0<j<k<=n} P(k)-P(j), where P(j)=A065091(j) is the j-th odd prime.at n=20A206803