Properties of the Number 6423

Six Thousand Four Hundred Twenty-Three

Basics

Value: 6422 → 6423 → 6424

Parity: odd

Prime: No

Previous Prime: 6421

Next Prime: 6427

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 2141

Divisors: 1, 3, 2141, 6423

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1100100010111

Octal: 14427

Duodecimal: 3873

Hexadecimal: 1917

Square: 41254929

Square Root: 80.14362108115655

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

Least k such that the k-th maximal antirun of prime numbers > 3 has length n. Position of first appearance of n in A027833. The sequence ends if no such antirun exists. A373401

Number of digits in A110776(n). A110777

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302212

Column 4 of an array closely related to A083480. (Both arrays have shape sequence A083479). A89574

One-half the number of permutations of length n with exactly 2 rising or falling successions. A349

Triangle read by rows: T(n,k) is one-half the number of permutations of length n with exactly n-k rising or falling successions, for n >= 1, 1 <= k <= n. T(1,1) = 1 by convention. A10028

G.f. satisfies: A(x) = 1/(1 + x·A(x³)) and also the continued fraction: 1+x·A(x⁴) = [1;1/x,1/x³,1/x⁹,1/x²⁷,...,1/x^{3^(n-1}),...]. A101913

a(n) = floor((10·n³ + 57·n² + 102·n + 72) / 72). A254875

Triangle read by rows: T(n,k) = one-half number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1. T(1,0) = 1 by convention. A86856

One of the two successive approximations up to 2ⁿ for 2-adic integer sqrt(17). This is the 3 (mod 4) case. A341539