Properties of the Number 4051

Four Thousand Fifty-One

Basics

Value: 4050 → 4051 → 4052

Parity: odd

Prime: Yes

Previous Prime: 4049

Next Prime: 4057

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 4051

Divisors: 1, 4051

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111111010011

Octal: 7723

Duodecimal: 2417

Hexadecimal: fd3

Square: 16410601

Square Root: 63.647466563878254

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 "sets of lists": number of partitions of {1,...,n} into any number of lists, where a list means an ordered subset. A262

a(n) = 2·n² + 1. A58331

Primes with 10 as smallest positive primitive root. A61323

Largest prime factor of 2ⁿ + 1. A2587

Primes with first digit 4. A45710

Number of integer partitions of n with no part divisible by all the others. A343341

Balanced primes of order three. A82078

Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A257740

G.f. A(x) = ∑_n=-oo..+oo xⁿ * (1 + xⁿ)^2·n. A260147

Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the set; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A319501