6751
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6952
- Proper Divisor Sum (Aliquot Sum)
- 201
- 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
- 6552
- Möbius Function
- 1
- Radical
- 6751
- 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
- 137
- 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
- Molien series for A_11.at n=33A008634
- Number of partitions of n into at most 11 parts.at n=33A008640
- Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.at n=31A027865
- a(n) = 2*n^3 + 1.at n=15A033562
- Base 9 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,2,3.at n=4A037679
- Shifts left under Weigh transform.at n=39A038073
- Numerators of continued fraction convergents to sqrt(649).at n=6A042246
- Numbers k such that k^14 == 1 (mod 15^3).at n=8A056087
- Number of digits in n-th even perfect number (A000396).at n=22A061193
- a(n) = floor(C(n+6,6)/C(n+2,2)).at n=35A084626
- Numbers n such that A003313(n) = A003313(2n).at n=22A086878
- Number of partitions of n into parts congruent to {0, 1, 3, 5} mod 6.at n=47A096981
- Smallest x such that sigma(x) mod 210 = n.at n=22A097014
- Numbers m not of the form k*(k+2) that have a single '1' in the periodic part of the continued fraction of sqrt(n).at n=30A102538
- a(n) = (1/6)*(n^3 + 21*n^2 + 74*n + 18).at n=28A103145
- Numbers whose square is the sum of distinct double factorials (A006882).at n=47A115649
- Each term k provides a value of (sum-of-digits of 5^k)/k that is closer to Pi than the previous value.at n=10A119666
- Numbers n for which 12n+1, 12n+5, 12n+7 and 12n+11 are primes.at n=33A123985
- Difference between first twin prime > 10^n and 10^n.at n=33A124001
- Triangle of the numerators of the almost-harmonic numbers: n-th term in m-th row is numerator of (sum{k=1 to m} 1/k) - 1/n, 1<=n<=m.at n=48A125900