ℕ atory
Play Now

Properties of the Number -16271

Sixteen Thousand Two Hundred Seventy-One

Basics

Value: -16272 → -16271 → -16270

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 53 × 307

Divisors: 1, 53, 307, 16271

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111110001111

Octal: -37617

Duodecimal: -94BB

Hexadecimal: -3f8f

Square: 264745441

Square Root: 127.55783002230793

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

Integers of the form 8k+7 that can be written as a sum of four distinct squares of the form m, m+2, m+4, m+5, where m == 1 (mod 4). A243579
Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 181", based on the 5-celled von Neumann neighborhood. A279671
Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 579", based on the 5-celled von Neumann neighborhood. A289467
a(n) is a binary encoded version of A355057(n). A354765
Semiprimes which are the sum of three distinct positive cubes in two or more distinct ways. A180089
Numerators of continued fraction convergents to sqrt(421). A41800
(1, 3, 5, 7, 9, ...) convolved with (1, 0, 3, 5, 7, 9, ...). A179903
Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood. A271412
a(n) is the least integer k such that there are n values of i <= k for which gpf(i2 + 1) = gpf(k2 + 1), where gpf(x) is the greatest prime factor of x. A258840