ℕ atory
Play Now

Properties of the Number -14367

Fourteen Thousand Three Hundred Sixty-Seven

Basics

Value: -14368 → -14367 → -14366

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 4789

Divisors: 1, 3, 4789, 14367

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11100000011111

Octal: -34037

Duodecimal: -8393

Hexadecimal: -381f

Square: 206410689

Square Root: 119.86242113356462

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

Take a squarefree semiprime and take the difference between its prime factors. If this difference is a squarefree semiprime repeat the process. Sequence lists the smallest squarefree semiprime that generates other squarefree semiprimes in the first n steps of this process. A296808
Expansion of x/((1 - x - x4)*(1 - x)4). A145133
Numerators of continued fraction convergents to sqrt(911). A42760
Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits. A131367
Positive numbers k such that k and 4·k are anagrams in base 8 (written in base 8). A23075
Numbers k such that k6 - 2 and k6 + 2 are both primes. A154938
a(n+2) = a(n+1) + a(n) + A·tn, with A = 1 and t = -2. A224508
Partial sums of the second power of arithmetic derivative function A003415. A231864
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
Number of repeating products of any subset of {1, 2, 3, ..., n}. A255962