Properties of the Number 13054

Thirteen Thousand Fifty-Four

Basics

Value: 13053 → 13054 → 13055

Parity: even

Prime: No

Previous Prime: 13049

Next Prime: 13063

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 61 × 107

Divisors: 1, 2, 61, 107, 122, 214, 6527, 13054

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001011111110

Octal: 31376

Duodecimal: 767A

Hexadecimal: 32fe

Square: 170406916

Square Root: 114.25410277097274

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

Expansion of 1/(1 - x + x² - x³ - x⁶ - x⁹ + x¹⁰ - x¹¹ + x¹²). A225499

Antidiagonal sums of square table A086623. A86625

Sphenic numbers (A007304) whose neighbors are sphenic. A248202

Numbers n such that n and the n-th prime have the same digits. A74350

Total number of parts of multiplicity 3 in all partitions of n. A117524

Number of Dyck paths of semilength n which satisfy the condition: number of returns + number of hills < number of peaks. A217539

Denominators of continued fraction convergents to sqrt(520). A41995

a(n) is the number of Dyck paths of semilength n without height of peaks 0 (mod 3) and height of valleys 1 (mod 3). A152172

a(1)=1, a(2)=6; for n > 2, a(n) is the smallest unused positive number such that gcd(a(n-1)+n, a(n)) > 1, gcd(a(n-1), a(n)) > 1, and gcd(n, a(n)) > 1. A349492

Numbers n such that σ(2*φ(n)) = 2*σ(n). A137733