Properties of the Number 27507

Twenty-Seven Thousand Five Hundred Seven

Basics

Value: 27506 → 27507 → 27508

Parity: odd

Prime: No

Previous Prime: 27487

Next Prime: 27509

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 53 × 173

Divisors: 1, 3, 53, 159, 173, 519, 9169, 27507

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101101110011

Octal: 65563

Duodecimal: 13B03

Hexadecimal: 6b73

Square: 756635049

Square Root: 165.85234396896536

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

Partial sums of A299268. A299269

G.f. A(x) satisfies 1/x¹⁹ = ∑_n=-oo..+oo A(x)ⁿ * xⁿ * (1 - xⁿ)ⁿ⁺⁸. A384824

Number of partitions p of n for which Odd(p) = Odd(p') (mod 4), where p' is the conjugate of p. A97566

Related to self-avoiding walks on square lattice. A6815

a(n) = 52·n² - 1. A158640

1/(Integral_x=0..1 x^{x^(xⁿ}) dx - 1/2), rounded to the nearest integer. A322009

Number of length n+1 0..2 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. A250640

Expansion of x*(1+2·x)/(1+x+x²-2·x³). A103749

T(n,k)=Number of length n+1 0..k arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. A250646

First column of A027495. A27507