Properties of the Number 4291

Four Thousand Two Hundred Ninety-One

Basics

Value: 4290 → 4291 → 4292

Parity: odd

Prime: No

Previous Prime: 4289

Next Prime: 4297

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 613

Divisors: 1, 7, 613, 4291

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000011000011

Octal: 10303

Duodecimal: 2597

Hexadecimal: 10c3

Square: 18412681

Square Root: 65.50572494064927

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

a(n) = 4·n² - 10·n + 7. A54554

Numbers that are the sum of 7 positive 6th powers. A3363

Number of strict integer partitions of n with a part dividing all the other parts. A97986

Number of primes less than 1000n. A38812

Values of n such that L(12) and N(12) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227515

Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n). A81720

Number of bracelets of n beads in up to n colors. A81721

Number T(n,k) of permutations p of [n] such that 0p has a nonincreasing jump sequence beginning with k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A291684

a(1) = 2; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A33679

Numbers k such that the digits of σ(k) are a permutation of those of k, in base 10. A115920