Properties of the Number -14061

Fourteen Thousand Sixty-One

Basics

Value: -14062 → -14061 → -14060

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 43 × 109

Divisors: 1, 3, 43, 109, 129, 327, 4687, 14061

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11011011101101

Octal: -33355

Duodecimal: -8179

Hexadecimal: -36ed

Square: 197711721

Square Root: 118.57908753233008

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

Centered 20-gonal (or icosagonal) numbers. A69133

First member of the Diophantine pair (m,k) that satisfies 6(m² + m) = k² + k: a(n) = m. A77288

Numbers k such that k!! + 2⁴ is prime. A76189

Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right. A234691

Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600. A6416

Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j³+k³, ordered by increasing i; sequence gives j values. A54206

a(1)=1. For n>1, a(n) equals the smallest number > a(n-1) of the form a(k) U j U a(k) U j, where U represents concatenation (written in decimal) of the binary representation of the arguments, where 1<=k < n, and j = {0} or {1} or {}. A175336

Positive integers k such that k divides 13^k + 2. A333413

Number of active (ON, black) cells at stage 2ⁿ-1 of the two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood. A270178

The smallest positive number k such that the sum of the products of its digits when written in all bases 2 to n equals k, or -1 if no such number exists. A376860