6527
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6696
- Proper Divisor Sum (Aliquot Sum)
- 169
- 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
- 6360
- Möbius Function
- 1
- Radical
- 6527
- 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
- 75
- 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
- no
- Odd
- yes
Appears in sequences
- a(0) = 1, a(n) = 29*n^2 + 2 for n>0.at n=15A010019
- a(n) = [ Sum{(sqrt(j+1)-sqrt(i+1))^2} ], 1 <= i < j <= n.at n=49A025222
- a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=37A033681
- Denominators of continued fraction convergents to sqrt(218).at n=8A041407
- Numbers whose base-5 representation contains exactly two 0's and three 2's.at n=34A045183
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=29A055468
- Solutions k of the equation phi(k) = phi(k-1) + phi(k-2). Also known as Phibonacci numbers.at n=20A065557
- Composite numbers k such that phi(k) = phi(k-1) + phi(k-2).at n=2A065572
- Indices of spheres mentioned in A071609.at n=44A076180
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=22A082409
- Molien series for group of order 4608 acting on joint weight enumerators of a pair of binary doubly-even self-dual codes.at n=35A097870
- Numbers n such that (n + prime(n)), (n+1 + prime(n+1)) and (n+2 + prime(n+2)) are divisible by 5.at n=43A107581
- Poincaré series [or Poincare series] P(C#_{4,2}; x).at n=12A124631
- G.f.: A(x) = Sum_{n>=0} log( (1 + 2^n*x)*(1 + 3^n*x) )^n / n!.at n=3A136578
- A sequence of asymptotic density zeta(8) - 1, where zeta is the Riemann zeta function.at n=26A143034
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 1), (0, 1), (1, -1), (1, 0), (1, 1)}.at n=6A151321
- Integers of the form: 0/3 + 1/3 + 2/3 + 3/3 + 5/3 + 7/3 + 11/3 + 13/3 + 17/3 + ....at n=33A182155
- Number of ordered octuples of distinct pairwise coprime positive integers with largest element n.at n=14A186979
- Number of 7-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=17A186983
- Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4.at n=7A196584