Properties of the Number 13077

Thirteen Thousand Seventy-Seven

Basics

Value: 13076 → 13077 → 13078

Parity: odd

Prime: No

Previous Prime: 13063

Next Prime: 13093

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1453

Divisors: 1, 3, 9, 1453, 4359, 13077

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001100010101

Octal: 31425

Duodecimal: 7699

Hexadecimal: 3315

Square: 171007929

Square Root: 114.35471131527551

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

Number of partitions of n in which each part, with the possible exception of the largest, occurs at least twice. A116931

Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2. A127485

Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2 = A127483(k+3) - 3. A127486

Numbers k in A228058 such that also A001065(k) is in A228058. A325380

Coefficients in the expansion of ([s] + [2s]x + [3s]x² + ...)/([r] + [2r]x + [3r]x² + ...); [ ] = floor, r = sqrt(2), s = sqrt(3). A279628

Expansion of solution to xA(x)(A(x)-x+1)=A(xA(x)). A91600

Number of compositions of n such that the maximal distance between two identical parts equals three. A262196

Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only either three adjacent vertically or three adjacent horizontally. A145761

Number of fundamentally different graceful labelings of the n-helm graph. A387800

Let f denote the map that replaces k with the concatenation of its nontrivial divisors, written in increasing order, each divisor being written in base 10 with its digits in reverse order. Then a(n) = prime reached when starting at 2n+1 and iterating f. A130140