6479
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7680
- Proper Divisor Sum (Aliquot Sum)
- 1201
- 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
- 5400
- Möbius Function
- -1
- Radical
- 6479
- 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
- 124
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=31A000297
- a(n) = n*(9*n - 1)/2.at n=38A022266
- (d(n)-r(n))/5, where d = A008778 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=54A026053
- Numbers having four 5's in base 6.at n=4A043392
- Numbers having three 8's in base 9.at n=15A043487
- Numbers whose base-3 representation contains no 0's and exactly one 1.at n=31A044966
- Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=3A049062
- Least inverse of A056796.at n=19A056817
- Nonprimes m such that phi(m)*sigma(m) is divisible by m+1.at n=34A065148
- Composite numbers k that divide Fibonacci(k+1).at n=5A069107
- Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.at n=24A072671
- Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum of the terms in the n-th group.at n=18A074120
- Numbers k such that binomial(prime(k), k) is divisible by k^2.at n=18A081384
- Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=2A093372
- Odd composites m that divide Fibonacci(m)-1.at n=3A094394
- Numbers k that divide Lucas(k) + 1.at n=22A094398
- Odd numbers k that divide Lucas(k) + 1.at n=5A094399
- Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.at n=3A094402
- Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).at n=1A094409
- Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1.at n=4A094412