Properties of the Number -4053

Fifty-Three

Basics

Value: -4054 → -4053 → -4052

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 193

Divisors: 1, 3, 7, 21, 193, 579, 1351, 4053

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -111111010101

Octal: -7725

Duodecimal: -2419

Hexadecimal: -fd5

Square: 16426809

Square Root: 63.66317616958802

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

Triangle read by rows. T(n, k) = BellPolynomial(n, -k). A350263

a(n) = exp(3) * ∑_k>=0 (-3)^k*kⁿ/k!. A309084

Number of conjugacy classes in GL(n,2). A6951

Number of points of norm <= n² in square lattice. A328

Expansion of (1/(1-x²))*∏_m>=0 1/(1-x^2m+1). A38348

Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 4·T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + 5·T(n-1,k) + T(n-1,k+1) for k >= 1. A126331

Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (same as A160410, but a(1) = 1, not 4). A160414

a(n) = 2·n² + 3. A93328

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

Start with a single square; at n-th generation add a square at each expandable vertex; a(n) is the sum of all label values at n-th generation. (See comment for construction rules.) A247618