Properties of the Number 3053

Three Thousand Fifty-Three

Basics

Value: 3052 → 3053 → 3054

Parity: odd

Prime: No

Previous Prime: 3049

Next Prime: 3061

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 43 × 71

Divisors: 1, 43, 71, 3053

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101111101101

Octal: 5755

Duodecimal: 1925

Hexadecimal: bed

Square: 9320809

Square Root: 55.25395913416522

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² - 3·n + 1. A54552

Numbers k such that (k! + 3)/3 is prime. A89085

Number of integer partitions of n whose weak run-sums cover an initial interval of nonnegative integers. A353863

a(n) = n*(3·n + 13)/2. A140672

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

Numbers n for which the third maximal prime <= sqrt(n) is the least prime divisor of n. A247394

Permutation of natural numbers: a(1) = 1, a(2n) = A014580(a(n)), a(2n+1) = A091242(a(n)), where A014580(n) = binary code for n-th irreducible polynomial over GF(2) and A091242(n) = binary code for n-th reducible polynomial over GF(2). A245702

Number of ON cells after n generations of the Schrandt-Ulam cellular automaton on the square grid that is described in the Comments. A170896

Permutation of natural numbers: a(1) = 1, a(2n) = A091242(a(n)), a(2n+1) = A014580(a(n)), where A091242(n) = binary code for n-th reducible polynomial over GF(2) and A014580(n) = binary code for n-th irreducible polynomial over GF(2). A246202

Number of unlabeled clutters (connected antichains) spanning up to n vertices with singleton edges allowed. A304982