ℕ atory
Play Now

Properties of the Number 4296

Four Thousand Two Hundred Ninety-Six

Basics

Value: 4295 → 4296 → 4297

Parity: even

Prime: No

Previous Prime: 4289

Next Prime: 4297

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 3 × 3 × 179

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 179, 358

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000011001000

Octal: 10310

Duodecimal: 25A0

Hexadecimal: 10c8

Square: 18455616

Square Root: 65.54387843269576

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

Expansion of ∏k>=1 (1 + 3·xk). A32308
A B2 sequence: a(n) is the least value such that sequence increases and pairwise sums of elements are all distinct. A25582
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the six simple ratios of musical harmony: 6/5, 5/4, 4/3, 3/2, 8/5 and 5/3. A54540
Number of multisets summing to n not equal to the first sums of any nonempty multiset. A390447
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to four of the simple ratios of musical harmony: 5/4, 4/3, 3/2 and 8/5. A60525
Number of 3 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing. A86113
Result of using the primes as coefficients in an infinite polynomial series in·and then expressing this series as (1+x)(1+a(1)*x)(1+a(2)*x2) ... . A147541
T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001. A260544
a(n) = A289676(3·n+1). A290436
The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts. A102186