Properties of the Number -41455

Forty-One Thousand Four Hundred Fifty-Five

Basics

Value: -41456 → -41455 → -41454

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 8291

Divisors: 1, 5, 8291, 41455

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010000111101111

Octal: -120757

Duodecimal: -1BBA7

Hexadecimal: -a1ef

Square: 1718517025

Square Root: 203.60500976154785

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

Second-order Fibonacci numbers. A10049

Form a triangle with n numbers in top row; all other numbers are the sum of their parents. E.g.: 4 1 2 7; 5 3 9; 8 12; 20. The numbers must be positive and distinct and the final number is to be minimized. Sequence gives final number. A28307

G.f. A(x) satisfies: ∑_k=0..n [x^k] A(x)ⁿ = binomial(6·n,3·n). A244652

Column k=8 sequence of array A103728. A103735

Column k=10 sequence of array A103728. A103915

Number of length 4 0..n arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean. A244943

Number of factorizations of mⁿ into exactly six factors, where m is a product of two distinct primes. A277242

Number of subwords of the form DUUD or DDUUD in nondecreasing Dyck paths of length 2n. A377866

Number of n X n arrays of squares of integers with every 3X3 subblock summing to 4. A159201