6514
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9774
- Proper Divisor Sum (Aliquot Sum)
- 3260
- 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
- 3256
- Möbius Function
- 1
- Radical
- 6514
- 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
- 49
- 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
- yes
- Odd
- no
Appears in sequences
- "Pascal sweep" for k=10: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=42A009550
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=14A020417
- 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 80.at n=7A031578
- Numbers in which all pairs of consecutive base-5 digits differ by 2.at n=35A033083
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 5.at n=9A038636
- 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=25A039624
- Numbers whose base-5 representation contains exactly two 0's and three 2's.at n=31A045183
- Number of basis partitions of n+100 with Durfee square size 10.at n=20A069253
- 4th-order digital invariants: the sum of the 4th power of the digits of n equals some number k and the sum of the 4th power of the digits of k equals n.at n=3A072409
- Let n = d_1 d_2 ... d_k in base 10 and f(n) = Sum_{i=1..k} d_i^k; sequence gives numbers n such that n != f(n) but n = f(f(n)).at n=3A101335
- Limit set for operation of repeatedly replacing a number with the sum of the 4th power of its digits.at n=8A113708
- Column 1 of triangle A118032, where column 1 of the matrix square of A118032 forms a bisection of this sequence.at n=16A118034
- Triangle T, read by rows, equal to the matrix square of A118032 and also equal to a diagonal bisection of A118032; i.e., diagonal n of T equals diagonal 2n of A118032: T(n,k) = A118032(2n-k,k) for n>=k>=0.at n=46A118040
- Column 1 of triangle A118040, which is the matrix square of triangle A118032; also equals a bisection of A118034, which is column 1 of A118032.at n=8A118042
- Where record values occur in A062039.at n=52A123644
- Number of Dyck paths such that the area between the x-axis and the path is n.at n=24A143951
- Numbers appearing in the cycles of the "Recurring Digital Invariant Variant" problem described in A151543.at n=33A151544
- Base-10 pseudo-altruistic numbers.at n=19A157714
- Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts.at n=43A168659
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * (1 + A(x))^n * A(x)^(n*(n+1)/2).at n=5A192259