6963
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10176
- Proper Divisor Sum (Aliquot Sum)
- 3213
- 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
- 4200
- Möbius Function
- -1
- Radical
- 6963
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=35A005576
- a(n)-th prime is sum of first k primes for some k.at n=20A020641
- Sum of distinct prime divisors of p(n)*p(n-1) + 1.at n=51A023529
- Number of distinct products i*j with 0 <= i, j <= n-th prime.at n=36A027419
- Cube root of A030697.at n=14A030698
- 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 83.at n=7A031581
- Starting positions of strings of 3 1's in the decimal expansion of Pi.at n=7A050209
- Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in exactly one way.at n=26A050797
- Column 1 of triangle A055370.at n=11A055371
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 0.at n=9A074406
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 2.at n=9A074408
- Numbers n such that n and n+1 both are members of A074997; i.e., on the one hand n-1 and n+1 have the same prime signature, on the other hand n and n+2 have the same prime signature.at n=41A086540
- 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=25A096906
- Numbers n such that (n+2) | (2^n+3^n).at n=6A123049
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having abscissa of the first return to the x-axis equal to 2k (1 <= k <= n).at n=42A129159
- Numbers k such that k and k^2 use only the digits 3, 4, 6, 8 and 9.at n=12A137129
- 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, 0, 0), (-1, 0, 1), (1, -1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A149794
- a(n) = 81*n^2 - 118*n + 43.at n=10A156677
- n such that the Moebius function take successively, from n, the values -1,0,-1,0,-1,0.at n=35A172354
- Numbers of the form x^2 + y^2 + z^2 = phi(x*y*z) + sigma(x*y*z).at n=18A173792