6739
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7056
- Proper Divisor Sum (Aliquot Sum)
- 317
- 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
- 6424
- Möbius Function
- 1
- Radical
- 6739
- 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
- 181
- 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
- "Magic" integers: a(n+1) is the smallest integer m such that there is no overlap between the sets {m, m-a(i), m+a(i): 1 <= i <= n} and {a(i), a(i)-a(j), a(i)+a(j): 1 <= j < i <= n}.at n=46A004210
- a(n) = ((n+1)-st Fibonacci number) - (n-th non-Fibonacci number).at n=18A014241
- Sum of the lengths of the cycle types of the permutation created by duality and reversal on the partitions of n.at n=30A036050
- Numbers having four 1's in base 6.at n=24A043376
- Recip transform of 2*(1 + x^3 + x^4 + x^6)-1/(1-x).at n=8A049165
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.at n=26A049791
- McKay-Thompson series of class 46C for the Monster group.at n=51A058689
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 10 (most significant digit on right).at n=6A061963
- Prefixing, suffixing or inserting a 9 in the number anywhere gives a prime.at n=32A069833
- a(1) = 6; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=46A074342
- Beginning with 2, least number such that concatenation of r copies of a(r), r = 1 to n is prime.at n=44A090559
- Table, T(n,k) is the number of categories with n morphisms and k objects.at n=39A125697
- Number of n-lobsters.at n=14A130131
- Number of non-Fibonacci parts in all partitions of n.at n=27A144116
- Sequence S such that 1 is in S and if x is in S, then 6x-1 and 6x+1 are in S.at n=46A147993
- Sum of first n isolated (or single) primes A007510.at n=33A153478
- Positions of 2's in A171922.at n=22A171925
- n^3+Largest square, (Largest square <= n^3).at n=15A176580
- Total number of positive integers < 10^n with multiplicative digital root value 0.at n=3A263470
- Expansion of Product_{k>=1} 1/(1 - (5*k-3)*x^(5*k-3)).at n=24A265833