Properties of the Number 4392

Four Thousand Three Hundred Ninety-Two

Basics

Value: 4391 → 4392 → 4393

Parity: even

Prime: No

Previous Prime: 4391

Next Prime: 4397

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 61

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000100101000

Octal: 10450

Duodecimal: 2660

Hexadecimal: 1128

Square: 19289664

Square Root: 66.27216610312357

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 partitions of n with nonnegative crank. A64428

Partial sums of A299255. A299261

Numbers that are the sum of 3 positive 5th powers. A3348

Numbers that can be expressed as the difference of the squares of primes in just two distinct ways. A90788

Number of primes less than 1000n. A38812

Triangle T, read by rows, equal to a diagonal bisection of A118032 such that diagonal n of T equals diagonal 2n+1 of A118032: T(n,k) = A118032(2n+1-k,k); also equals the matrix product of A118032 and SHIFT_UP(A118032). A118045

Triangle read by rows: T(n,m) (n >= m >= 1) = number of chambers (or regions) formed by drawing the line segments connecting any two of the (n+1) X (m+1) lattice points in an n X m lattice polygon. A288187

Number of maximal subsets of {1..n} such that every orderless pair of distinct elements has a different sum. A325878

Numbers k such that σ(x) = k has exactly 6 solutions. A60662

Numbers k such that φ(x) = k has exactly 10 solutions. A60673