Properties of the Number 4292

Four Thousand Two Hundred Ninety-Two

Basics

Value: 4291 → 4292 → 4293

Parity: even

Prime: No

Previous Prime: 4289

Next Prime: 4297

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 29 × 37

Divisors: 1, 2, 4, 29, 37, 58, 74, 116, 148, 1073

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000011000100

Octal: 10304

Duodecimal: 2598

Hexadecimal: 10c4

Square: 18421264

Square Root: 65.5133574166368

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

Numbers that are the sum of 8 positive 6th powers. A3364

Number of integer partitions of n such that every set of distinct parts has a different sum. A325862

Number of integer partitions of n with a different mean, median, and mode, assuming there is a unique mode. A363725

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal. A233892

Consecutive states of the linear congruential pseudo-random number generator (211·s + 1663) mod 7875 when started at s=1. A385002

G.f.: ∑_k>=1 x^k/(1-x^k) * ∏_k>=1 (1+x^k)/(1-x^k). A305102

a(n) is the number of nonnegative integers that can be represented in a 7-segment display by using only n segments (version A006942). A331529

Number of polygons formed when every pair of vertices of a row of n adjacent congruent rectangles are joined by an infinite line. A344993

a(n) = n·Fibonacci(n) - ∑_i=0..n Fibonacci(i). A122491

Numbers k such that k¹⁰ + 9 is prime. A125264