Properties of the Number -26477

Twenty-Six Thousand Four Hundred Seventy-Seven

Basics

Value: -26478 → -26477 → -26476

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 11 × 29 × 83

Divisors: 1, 11, 29, 83, 319, 913, 2407, 26477

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110011101101101

Octal: -63555

Duodecimal: -133A5

Hexadecimal: -676d

Square: 701031529

Square Root: 162.71754668750387

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

Number of unimodal compositions of n+2 where the maximal part appears exactly twice. A114921

Number of λ calculus terms of size n, where size(λ x.M) = 2 + size(M), size(M N) = 2 + size(M) + size(N), and size(V) = 1 + i for a variable V bound by the i-th enclosing λ (corresponding to a binary encoding). A114851

Number of doubletons in all partitions of n. By a doubleton in a partition we mean an occurrence of a part exactly twice (the partition [4,(3,3),2,2,2,(1,1)] has two doubletons, shown between parentheses). A116646

Row sums from A144562. A144640

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)*b(n), where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296275

Number of 0..n arrays of length 6 with each element differing from at least one neighbor by 2 or more, starting with 0. A221517