6934
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10404
- Proper Divisor Sum (Aliquot Sum)
- 3470
- 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
- 3466
- Möbius Function
- 1
- Radical
- 6934
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 even period and if the last term of the periodic part is deleted the central term is 82.at n=16A031580
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=7A031824
- Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors (excluding the proper divisor 1). Rearrangements which cause leading zeros are excluded.at n=5A086248
- Triangle T, read by rows, such that T(n,k) equals the (n-k)-th row sum of T^k, where T^k is the k-th power of T as a lower triangular matrix.at n=46A091351
- Row sums of triangle A091351, in which the k-th column lists the row sums of the k-th power of A091351 (when considered as a lower triangular matrix).at n=8A091352
- Triangle, read by rows, such that T(n,k) equals the k-th term of the convolution of the (n-1)-th diagonal with the k-th row of this triangle.at n=53A098446
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT_UP(T) = T^2 - T + I, or, equivalently: T(n+1,k+1) = [T^2](n,k) - T(n,k) + [T^0](n,k) for n>=k>=0, with T(0,0)=1.at n=56A104445
- Number of partitions of n with no even parts repeated and with no 1's.at n=50A117275
- Expansion of x*(1+2*x+3*x^2+4*x^3+4*x^4)/(1+x+x^2+x^3-x^5).at n=58A122520
- Rectangular table, read by antidiagonals, defined by the following rule: start with all 1's in row zero; from then on, row n+1 equals the partial sums of row n excluding terms in columns k = m*(m+1)/2 - 2 (m>=2).at n=46A125781
- Triangle, read by rows, where row n+1 is generated from row n by first inserting zeros at positions {(m+2)*(m+3)/2, m>=0} in row n and then taking the partial sums in reverse order, for n>=2, starting with 1's in the initial two rows.at n=69A127420
- a(n) = round(log(Fibonacci(prime(k))/prime(k))), where k = A119984(n).at n=25A134792
- a(0)=4; a(n)=n^2+a(n-1) for n>0.at n=27A153058
- Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square.at n=34A163433
- Partial sums of A165271.at n=22A165273
- 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=30A178980
- Number of right triangles on an (n+1) X 3 grid.at n=31A189807
- Numbers whose arithmetic derivatives are a permutation of their digits.at n=15A225902
- Number of partitions p of n that do not include (min(p) + max(p))/2 as a part.at n=31A238481
- Numbers n such that n + 15, n^2 + 15 and n^3 + 15 are prime.at n=48A253143