Properties of the Number 12178

Twelve Thousand One Hundred Seventy-Eight

Basics

Value: 12177 → 12178 → 12179

Parity: even

Prime: No

Previous Prime: 12163

Next Prime: 12197

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 6089

Divisors: 1, 2, 6089, 12178

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10111110010010

Octal: 27622

Duodecimal: 706A

Hexadecimal: 2f92

Square: 148303684

Square Root: 110.35397591387454

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

Matula-Goebel numbers of semi-lone-child-avoiding rooted identity trees. A331963

a(0)=1, a(1)=1, a(2)=1, a(n) = 2·a(n-1) + a(n-2) + 1. A33539

Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number·such that b(k,n) - b(k-1,n) is a constant·depending only on n, for k > y = A074483(n). Sequence gives values of x. A74482

Expansion of (1 + 3·x - 2·x²)/(1 - 7·x + 7·x² - x³). A301383

Matula-Goebel numbers of unlabeled rooted identity RPMG-trees, meaning the Matula-Goebel numbers of the branches of any non-leaf node are relatively prime. A316469

Matula-Goebel tree number of tree n with a new leaf added below each existing vertex. A348067

Array read by antidiagonals: T(n,k) is the number of sets of k integer sided cuboids with distinct volumes that fill an n X n X n cube. A387121

Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 4. A296811

O.g.f. A(x) satisfies: 0 = [xⁿ] exp( n³ * Integral A(x)³ dx ) / A(x), for n > 0. A305142

Number of length 4+3 0..n arrays with some pair in every consecutive four terms totalling exactly n. A245954