6707
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7080
- Proper Divisor Sum (Aliquot Sum)
- 373
- 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
- 6336
- Möbius Function
- 1
- Radical
- 6707
- 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
- 44
- 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
- a(1)=1, a(n) = smallest odd number such that all sums of pairs of (not necessarily distinct) terms in the sequence are distinct.at n=42A034757
- Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=36A035951
- Number of primes between n*100000 and (n+1)*100000.at n=29A038825
- Denominators of continued fraction convergents to sqrt(519).at n=10A041993
- Base-6 palindromes that start with 5.at n=20A043014
- Numbers n such that 213*2^n-1 is prime.at n=29A050858
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=27A056068
- Engel expansion of 1/log(10) = 0.434294....at n=11A059184
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=23A064909
- Rounded total surface area of a regular octahedron with edge length n.at n=44A071396
- Smallest multiple of n beginning with the n-th prime.at n=18A078208
- Minimal last term of an n-tuple of pairwise coprime composites in A.P.at n=8A087795
- Take a <= b such that f(a)+f(b)=concatenation of a and b, where f(k)=k(k+3)/2 (A000096). Sequence gives values of a.at n=34A099148
- a(n) = least k such that the remainder when 9^k is divided by k is n.at n=42A127817
- Super anti-perfect numbers.at n=5A192275
- Some numbers of the form 2*x^3 + y^3 + z^3 found by a certain algorithm.at n=13A195006
- n for which A079277(n) + phi(n) < n.at n=10A208815
- Number of nondecreasing sequences of n 1..5 integers with no element dividing the sequence sum.at n=49A212865
- Number of ordered triples (i,j,k) with |i|, |j|, |k|, |i*j*k| <= n.at n=21A226359
- Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (2,k)-anti-perfect numbers.at n=21A229860