Properties of the Number 4393

Four Thousand Three Hundred Ninety-Three

Basics

Value: 4392 → 4393 → 4394

Parity: odd

Prime: No

Previous Prime: 4391

Next Prime: 4397

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 23 × 191

Divisors: 1, 23, 191, 4393

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000100101001

Octal: 10451

Duodecimal: 2661

Hexadecimal: 1129

Square: 19298449

Square Root: 66.27971031922213

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 rucksack partitions of n: every consecutive constant subsequence has a different sum. A353864

Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of k 4-gonal polygonal components chained with string components of length 2 as k varies. A152930

Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of three m-gonal polygonal components chained with string components of length 2 as m varies. A152931

Integers of the form m*(m + 7)/8. A274979

a(n) = n*(8·n+7). A139278

Number of integer partitions of n where the parts have the same mean as the distinct parts. A360243

Number of parts unequal to 1 in all partitions of the integer n. Also the difference between the labeled and the unlabeled case of one-element transitions from the partitions of n to the partitions of n+1. A96541

Number of parts that are visible in one of the three views of the section model of partitions version "tree" with n sections. A194805

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i·x(i,j), i=1..n+1} nondecreasing. A233062

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011. A260501