Properties of the Number -14503

Fourteen Thousand Five Hundred Three

Basics

Value: -14504 → -14503 → -14502

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 14503

Divisors: 1, 14503

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11100010100111

Octal: -34247

Duodecimal: -8487

Hexadecimal: -38a7

Square: 210337009

Square Root: 120.42840196564929

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

Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges. A339560

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,0,1,0,1 for x=0,1,2,3,4. A197672

Non-palindromic balanced primes. A256076

Smallest primitive prime factor of the n-th Lucas number (A000032); i.e., L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2). A58036

Largest prime dividing the n-th Lucas number (A000032); 1 when no such prime exists. A79451

Order in which prime factors first occur in the Lucas sequence. A96362

Primes p such that 6p + 7 is a square. A110014

Primes p that divide Fibonacci[(p+1)/7]. A125252

Prime numbers that are Fibonacci integers. A178762

a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }. A22905