Properties of the Number -26470

Twenty-Six Thousand Four Hundred Seventy

Basics

Value: -26471 → -26470 → -26469

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 2647

Divisors: 1, 2, 5, 10, 2647, 5294, 13235, 26470

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110011101100110

Octal: -63546

Duodecimal: -1339A

Hexadecimal: -6766

Square: 700660900

Square Root: 162.6960356001338

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

Sum of the fourth largest parts in the partitions of n into 8 parts. A308995

Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z. A212068

Sum of squares of numbers that can be written as t·n + u*(n+1) for nonnegative integers t,u in exactly two ways. A76461

Number of binary strings of length n with no substrings equal to 0000 or 0110. A164390

Number of set partitions of [n] into exactly ten blocks such that all odd elements are in blocks with an odd index and all even elements are in blocks with an even index. A274874

Bond series for second parallel moment of 4.8 (bathroom tile) lattice. A120555

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (composite numbers). A24461

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (composite numbers). A25081

Numbers k such that k-th and (k+1)-st term of A038593 differ by 3. A38634