Properties of the Number -262542

Two Hundred Sixty-Two Thousand Five Hundred Forty-Two

Basics

Value: -262543 → -262542 → -262541

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 ² × 19 × 47

Divisors: 1, 2, 3, 6, 7, 14, 19, 21, 38, 42

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000000000110001110

Octal: -1000616

Duodecimal: -107B26

Hexadecimal: -4018e

Square: 68928301764

Square Root: 512.3885244616628

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

T(n,k) = Sum of multinomial(n; n₁,n₂,...,n_k)², where the sum extends over all compositions (n₁,n₂,...,n_k) of n into exactly k nonnegative parts. A192722

Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^t+u+v) having four, five or six distinct values for every i,j,k<=n. A211576

Number of (3+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250771

Triangular array read by rows. T(n,k) is the number of ways to form an ordered pair of n-permutations and then choose a size k subset of its common descent set, n >= 0, 0 <= k <= max{0,n-1}. A362589