ℕ atory
Play Now

Properties of the Number 12346

Twelve Thousand Three Hundred Forty-Six

Basics

Value: 12345 → 12346 → 12347

Parity: even

Prime: No

Previous Prime: 12343

Next Prime: 12347

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 6173

Divisors: 1, 2, 6173, 12346

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000000111010

Octal: 30072

Duodecimal: 718A

Hexadecimal: 303a

Square: 152423716

Square Root: 111.11255554616679

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 simple graphs on n unlabeled nodes. A88
Number A(n,k) of k-uniform hypergraphs on n unlabeled nodes; square array A(n,k), n>=0, k>=0, read by antidiagonals. A309858
Array read by descending antidiagonals: A(n,k) is the number of unoriented colorings of the edges of a regular n-dimensional simplex using up to k colors. A327084
Table T(n,k) giving number of k-multigraphs on n nodes (n >= 1, k >= 0) read by antidiagonals. A63841
Integers k such that all the digits needed to write the consecutive nonnegative integers from 0 to k fill exactly a square (no holes, no overlaps). A158022
Triangle read by rows: T(n,k) is the number of unlabeled simple graphs on n vertices with domination number k. A263284
Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n). A294217
Number of 8-colorable (i.e., chromatic number <= 8) simple graphs on n nodes. A76320
Number of 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes. A76321
Triangle read by rows: T(n,k) is the number of unlabeled simple graphs with n vertices and maximum vertex degree k, (0 <= k < n). A263293