Properties of the Number -483840

Four Hundred Eighty-Three Thousand Eight Hundred Forty

Basics

Value: -483841 → -483840 → -483839

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁹ × 3 ³ × 5 × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1110110001000000000

Octal: -1661000

Duodecimal: -1B4000

Hexadecimal: -76200

Square: 234101145600

Square Root: 695.586083817093

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: terms of a binomial decomposition of 1 as Sum(k=0..n)T(n,k). A244117

a(n) = 8·7*6·5*4·3*2·1 - 16·15·14·13·12·11·10·9 + 24·23·22·21·20·19·18·17 - ... + (up to the n-th term). A319891

a(n) = det(M) where M is an n X n matrix with M[i,j] = lcm(i,j). A60238

G.f.: 1/(1-2·x+2·x²-x³+x⁴). A199802

Expansion of e.g.f.: (1-2·x)*sqrt(1-4·x). A126089

Trisection 2 of A199802. A199929

Products of distinct factorials. A58295

Amicable triples. Sequence gives σ values: A125490(n) + A125491(n) + A125492(n). A137231

Square array T(m,n) giving the number of m X n (0,1)-matrices with pairwise distinct rows and pairwise distinct columns. A181230

Smallest number k such that the symmetric representation of σ(k) has maximum width n for those k whose representation has nondecreasing width up to the diagonal. A250071