6770
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
- 8
- Divisor Sum
- 12204
- Proper Divisor Sum (Aliquot Sum)
- 5434
- 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
- 2704
- Möbius Function
- -1
- Radical
- 6770
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- The sequence m(n) in A022905.at n=41A022907
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.at n=38A024466
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (F(2), F(3), ...), t = A023533.at n=37A024595
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (F(2), F(3), F(4), ...), t = A023533.at n=36A025109
- Positive numbers having the same set of digits in base 6 and base 9.at n=28A037436
- Number of primes between n*100000 and (n+1)*100000.at n=24A038825
- Numbers whose base-5 representation contains exactly three 0's and two 4's.at n=18A045216
- a(n) is the least k such that k*(k+1)*Mersenne-prime(n)+1 is prime.at n=26A104038
- "Ceiling of hypotenuses": a(n) = ceiling(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=32A104805
- Modified Schroeder numbers for q=3.at n=47A114292
- a(n) = 625*n^2 - 886*n + 314.at n=3A157618
- a(n) = Fibonacci(n) + 5.at n=20A157729
- Number of trees that have a maximum 'n'.at n=24A168542
- a(n) = b(n) + b(n+1) + 2, where b() = A000930().at n=22A170934
- Total number of parts that are the smallest part or the largest part in all partitions of n.at n=22A182978
- a(n) = 3*n^2 - 3*n + 2.at n=48A242658
- Non-palindromic balanced numbers in base 16.at n=24A256080
- The integer part of the surface area of the 4-dimensional sphere of radius n.at n=6A261791
- The number of conjugacy classes of n X n matrices over GF(2) which are squares of other such matrices.at n=12A274313
- Numbers k such that 2*10^k + 93 is prime.at n=23A275523