6933
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9248
- Proper Divisor Sum (Aliquot Sum)
- 2315
- 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
- 4620
- Möbius Function
- 1
- Radical
- 6933
- 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
- 31
- Smith Number
- no
- 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
- no
- Odd
- yes
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 54.at n=39A031552
- Numbers k such that 261*2^k+1 is prime.at n=47A032507
- Number of partitions in parts not of the form 17k, 17k+3 or 17k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=35A035964
- Sum of first n primes of form 4k+1.at n=36A038346
- Pisot sequence L(9,10).at n=23A048592
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 22.at n=29A051963
- Numbers n occurring in binary representation of n*(n+1)/2.at n=36A092734
- Row sums of triangle A099514, so that a(n) = Sum_{k=0..n} coefficient of z^k in (1 + z + 2*z^2)^(n-[k/2]), where [k/2] is the integer floor of k/2.at n=10A099515
- Number of bipartite connected outerplanar graphs on n unlabeled nodes.at n=11A111758
- Numbers k such that the concatenation of n successive descending digits (1,0,9,8,7,...) starting with 1 is prime.at n=9A120828
- 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=47A125781
- Column 2 of table A125781.at n=7A125782
- a(n) = floor(log(Fibonacci(prime(k))/prime(k))), where k = A119984(n).at n=25A134791
- Number of n X n binary arrays with all ones connected only either three adjacent vertically or three adjacent horizontally.at n=5A145757
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only either three adjacent vertically or three adjacent horizontally.at n=13A145759
- 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, 0), (-1, 0, -1), (-1, 0, 1), (1, -1, -1), (1, 1, 0)}.at n=9A148607
- 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, 0), (-1, 0, 1), (-1, 1, -1), (1, -1, -1), (1, 1, 0)}.at n=9A148608
- 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, 0, 1), (0, -1, 1), (1, 1, 0)}.at n=9A148677
- 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, 0), (0, 0, -1), (0, 1, 0), (1, 0, 1)}.at n=8A149944
- a(0)=3; a(n) = n^2 + a(n-1) for n>0.at n=27A153057