6470
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11664
- Proper Divisor Sum (Aliquot Sum)
- 5194
- 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
- 2584
- Möbius Function
- -1
- Radical
- 6470
- 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
- 49
- 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
- Coordination sequence for FeS2-Marcasite, Fe position.at n=42A009955
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=54A011905
- Alkane (or paraffin) numbers l(11,n).at n=8A018212
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (composite numbers).at n=18A024471
- a(n) = floor( Sum_{1 <= i < j <= n} ((sqrt(j)-sqrt(i))^3) ).at n=33A025197
- Number of 2n-bead black-white reversible strings with n black beads.at n=8A032123
- Central column of Losanitsch's triangle A034851.at n=16A034872
- Numbers n such that there are equal numbers of 0's and 1's in first n digits of binary representation of Pi.at n=23A039624
- Base-9 palindromes that start with 8.at n=18A043035
- Expansion of exp(2x)/sqrt(1-x^2).at n=7A081920
- q such that p^4 + q^4 = r^4 + s^4 = a(n).at n=42A088665
- Numbers n such that prime(n) == -7 (mod n).at n=17A092049
- a(n) = Sum_{k=0..n} binomial(2*n,2*k)^2.at n=4A098772
- Number of n-element subsets of [2n] having an even sum.at n=8A119358
- Smallest k such that 3^(3^n) - k is prime.at n=11A140331
- Triangle of 4-Eulerian numbers.at n=18A144698
- a(n) = Sum_{d|n} binomial(n/d+d-2, d-1).at n=62A157019
- A triangle of matrix polynomials: m(n)=antisymmeticmatix(n).Transpose[antisymmeticmatix(n)].at n=40A158335
- a(n) = 2A(n)/C(n) where A(n) = A180874(n) and C(n) = Catalan(n) = A000108(n).at n=6A188664
- 20k^2-40k+10 interleaved with 20k^2-20k+10 for k>=0.at n=38A216875