Properties of the Number 4308

Four Thousand Three Hundred Eight

Basics

Value: 4307 → 4308 → 4309

Parity: even

Prime: No

Previous Prime: 4297

Next Prime: 4327

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 359

Divisors: 1, 2, 3, 4, 6, 12, 359, 718, 1077, 1436

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000011010100

Octal: 10324

Duodecimal: 25B0

Hexadecimal: 10d4

Square: 18558864

Square Root: 65.63535632568775

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 whose run-lengths are either weakly increasing or weakly decreasing. A332745

T(n,k)=Number of length n+5 0..k arrays with no disjoint triples in any consecutive six terms having the same sum. A247995

Number of integer partitions of n where the parts do not have the same mean as the distinct parts. A360242

Irregular triangle read by rows: T(n,k) (0 <= k <= n²) are coefficients of exact spanning probability for site percolation along the second dimension for an n X n 2D nnsquare lattice with periodic boundary conditions. A366467

Numbers k > 1 such that, in base 3, k and k² contain the same digits in the same proportion. A61657

p-INVERT of (1,0,0,1,0,0,0,0,0,...), where p(S) = (1 - S)². A292324

G.f. A(x) satisfies A(x/A(x)) = 1/(1-x). A88713

T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero. A230910

Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k. A294490

T(n,k)=Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and the median of every three consecutive elements nondecreasing. A263597