Properties of the Number 6527

Six Thousand Five Hundred Twenty-Seven

Basics

Value: 6526 → 6527 → 6528

Parity: odd

Prime: No

Previous Prime: 6521

Next Prime: 6529

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 61 × 107

Divisors: 1, 61, 107, 6527

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100101111111

Octal: 14577

Duodecimal: 393B

Hexadecimal: 197f

Square: 42601729

Square Root: 80.78985084773953

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Solutions k of the equation φ(k) = φ(k-1) + φ(k-2). Also known as Phibonacci numbers. A65557

T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4. A240000

a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A33681

A sequence of asymptotic density ζ(8) - 1, where ζ is the Riemann ζ function. A143034

a(n) = floor(6ⁿ/(3+sqrt(3))ⁿ). A240735

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 3,2,0,1,4 for x=0,1,2,3,4. A196590

Number of compositions of n that are either strictly increasing or strictly decreasing. A333147

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 3,2,0,4,1 for x=0,1,2,3,4. A196802

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,2,0,1,3 for x=0,1,2,3,4. A197047

Number of partitions p of n such that the number of numbers having multiplicity 1 in p is a part and the number of numbers having multiplicity > 1 is a part. A241414