Properties of the Number -3842

Eight Hundred Forty-Two

Basics

Value: -3843 → -3842 → -3841

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 17 × 113

Divisors: 1, 2, 17, 34, 113, 226, 1921, 3842

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111100000010

Octal: -7402

Duodecimal: -2282

Hexadecimal: -f02

Square: 14760964

Square Root: 61.98386886924694

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

Matrix inverse, read by rows, of triangle A104029, which forms the pairwise sums of trinomial coefficients. A104030

Expansion of B(x)², where B(x) is the g.f. of A108482. A373419

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 4.6.12 2D tiling (cf. A072154). A299258

Rectangular array A: first differences of row entries of array A294099, read by antidiagonals. A298675

Convolution triangle of A000129(n) (Pell numbers). A54456

a(n) = a(n-1) + 3·a(n-2). A6138

Number of right triangles of a given area required to form successively larger squares. A60626

Pendular triangle, read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), else T(n,k) = T(n,n-1-k) + 3·T(n-1,k), for n>=k>=0, with T(n,0)=1 and T(n,n)=0ⁿ. A118350

A modified Engel expansion for 3·sqrt(15) - 11. A220337

Total number of positive integers below 10ⁿ requiring 5 positive cubes in their representation as sum of cubes. A181381