Properties of the Number 12994

Twelve Thousand Nine Hundred Ninety-Four

Basics

Value: 12993 → 12994 → 12995

Parity: even

Prime: No

Previous Prime: 12983

Next Prime: 13001

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 73 × 89

Divisors: 1, 2, 73, 89, 146, 178, 6497, 12994

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11001011000010

Octal: 31302

Duodecimal: 762A

Hexadecimal: 32c2

Square: 168844036

Square Root: 113.99122773266372

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

Numbers n such that n¹⁰²⁴ + 1 is prime (a generalized Fermat prime). A57002

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. A207467

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically. A207918

a(n) = A083385(n)/n. A83410

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 0 and 1 0 1 vertically. A207519

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 1 0 and 1 0 1 vertically. A208698

Sphenic numbers (A007304) whose neighbors are sphenic. A248202

Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. A207462

a(n) = smallest number m which can be obtained in n ways by subtracting twice a triangular number from a perfect square. A78714

Number of partitions p of n such that 2·min(p) is not a part of p. A238594