Properties of the Number -14851

Fourteen Thousand Eight Hundred Fifty-One

Basics

Value: -14852 → -14851 → -14850

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 14851

Divisors: 1, 14851

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11101000000011

Octal: -35003

Duodecimal: -8717

Hexadecimal: -3a03

Square: 220552201

Square Root: 121.86467905016613

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

Primes of the form 5k² + 5k + 1. A90562

Number of compositions of n with all adjacent parts (x, y) satisfying x >= 2y or y >= 2x. A342333

Primes of the form 43·n² - 537·n + 2971 in order of increasing nonnegative values of n. A272285

Primes for which the weight as defined in A117078 is 23. A119504

a(n) = 5·F(n)² - 5·F(n) + 1, where F(n) = Fibonacci(n). A124296

Centered triangular numbers that are prime. A125602

Centered 15-gonal numbers: a(n) = (15·n² - 15·n + 2)/2. A69128

a(0)=1, a(1)=1, a(n) = 11·a(n/2) for even n, and a(n) = 10·a((n-1)/2) + a((n+1)/2) for odd n >= 3. A116525

5 F(2n) (F(2n) - 1) + 1 where F(n) denotes the n-th Fibonacci number. A156094

Number of set partitions B'_t(n) of {1,2,...,t} into at most n parts, so that no part contains both 1 and t, or both i and i+1 with 1 <= i < t; triangle B'_t(n), t>=0, 0<=n<=t, read by rows. A261137