Properties of the Number 4690

Four Thousand Six Hundred Ninety

Basics

Value: 4689 → 4690 → 4691

Parity: even

Prime: No

Previous Prime: 4679

Next Prime: 4691

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 7 × 67

Divisors: 1, 2, 5, 7, 10, 14, 35, 67, 70, 134

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001001010010

Octal: 11122

Duodecimal: 286A

Hexadecimal: 1252

Square: 21996100

Square Root: 68.48357467305573

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

a(n) is the number of ways to partition an n X n X n cube into 4 noncongruent cuboids. A384311

Primitive pseudoperfect numbers. A6036

G.f. satisfies A(x) = 1 + x·cycle_index(Sym(6), A(x)). A36722

Number of winning length n strings with a 10-symbol alphabet in "same game". A65243

T(n,k)=Number of nXk 0..2 arrays with diagonals and rows unimodal and antidiagonals nondecreasing. A224310

T(n,k)=Number of nXk 0..2 arrays with rows unimodal and antidiagonals nondecreasing. A224374

Number T(n,k) of (binary) heaps of length n whose element set equals [k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A373451

Positions of 10 after decimal point in decimal expansion of 1/π. A134260

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

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 0 or 1 and no column sum 0 or 1. A256810