6727
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7944
- Proper Divisor Sum (Aliquot Sum)
- 1217
- 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
- 5580
- Möbius Function
- 0
- Radical
- 217
- 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
- 49
- 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
- Expansion of 1/((1-x)*(1-2*x)*(1-x-2*x^3)).at n=10A003230
- a(1) = 1; a(n+1) = floor((sum{k=1 to n} a(k)^3)^(1/3)).at n=46A016085
- Numbers k such that in k and k^2 the parity of digits alternates.at n=32A030153
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 81.at n=14A031579
- a(n) = 7*n^2.at n=31A033582
- Number of independent vertex sets in the n-prism graph Y_n = K_2 X C_n (n > 2).at n=10A051927
- Integers > 1 whose prime divisors are all Mersenne primes (i.e., of the form (2^p - 1)).at n=45A056652
- Numbers k such that the squarefree part of k equals A062799(k).at n=19A069551
- Numbers k such that phi(k) mod core(k) = 1 where core(k) is the squarefree part of k.at n=44A069946
- Numbers n such that the digital binary sum of n equals core(n), the squarefree part of n.at n=31A077476
- Shallow diagonal of triangular spiral in A051682.at n=19A081275
- a(n) = 6*a(n-1) - a(n-2) - 4, a(0)=3, a(1)=7.at n=5A081555
- Number of base-3 circular n-digit numbers with adjacent digits differing by 1 or less.at n=10A124696
- a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^3 if n is even.at n=13A140149
- Numbers n such that there exists x in N : (x+31)^3-x^3=n^2.at n=0A145320
- 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=44A147993
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0), (1, 0, 1)}.at n=7A150371
- a(n) = 8*n^2 - 1.at n=28A157914
- a(n) = 841*n - 1.at n=7A158402
- a(n) = (81^n - 2^n)/79.at n=3A180846