Properties of the Number 27262

Twenty-Seven Thousand Two Hundred Sixty-Two

Basics

Value: 27261 → 27262 → 27263

Parity: even

Prime: No

Previous Prime: 27259

Next Prime: 27271

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 43 × 317

Divisors: 1, 2, 43, 86, 317, 634, 13631, 27262

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101001111110

Octal: 65176

Duodecimal: 1393A

Hexadecimal: 6a7e

Square: 743216644

Square Root: 165.11208314354224

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

a(n) = ∑_i=0..2 binomial(Fibonacci(n),i). A32441

Antidiagonal sums of table A083087. A83091

a(n) = ∑_k=1..n A001263(n,k) * A027656(k). A136520

G.f. satisfies A(x) = ∑_n>=0 xⁿ * abs(1/A(x)ⁿ), where abs(F(x)) equals the series expansion formed by the unsigned coefficients in F(x). A383377

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (-1, 1, 0), (1, 0, 0), (1, 0, 1)}. A150666

Vinogradov's constants arising in enumeration of solutions to Waring's problem in the evil numbers (A001969). A206375

a(n) is the smallest k such that φ(k) = reverse(k-n), or 0 if no such k exists. A241473

a(n) = self-convolution of row n of array T given by A026519. A27262