6925
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8618
- Proper Divisor Sum (Aliquot Sum)
- 1693
- 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
- 5520
- Möbius Function
- 0
- Radical
- 1385
- Omega Function (Ω)
- 3
- 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
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 period 27.at n=30A020366
- Numbers with exactly 7 1's in their ternary expansion.at n=16A023698
- T(2n,n), T given by A026703.at n=6A026704
- T(n,[ n/2 ]), T given by A026703.at n=12A026709
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 5.at n=35A031418
- Sums of 7 distinct powers of 3.at n=8A038469
- Numbers having three 4's in base 9.at n=32A043471
- a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times.at n=41A058361
- The n-th n-gonal number: a(n) = n*(n^2 - 3*n + 4)/2.at n=25A060354
- Numbers k such that each of k through k+4 are divisible by exactly two primes.at n=43A088986
- Numbers k such that (3*2^k+1)^2-2 is prime.at n=17A100912
- Triangle read by rows: T(n,k) is the number of unlabeled acyclic digraphs with n >= 0 nodes and n-k outnodes (0 <= k <= n).at n=48A122078
- Numbers k such that 3 and 5 do not divide binomial(2*k, k).at n=33A129508
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1000-1111-0001 pattern in any orientation.at n=11A146605
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1000-1111-0001 pattern in any orientation.at n=24A146607
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1000-1111-0001 pattern in any orientation.at n=25A146607
- Row sums of triangle defined in A120852.at n=24A160963
- a(n) = 7*n*(n+1)/2 - 5.at n=43A166154
- Composite numbers of form 8n+5 with all prime factors of form 8m+5.at n=28A175486
- Number of peakless Motzkin paths of length n having no (1,0)-steps at levels 0,2,4,... .at n=19A190165