Properties of the Number -26419

Twenty-Six Thousand Four Hundred Nineteen

Basics

Value: -26420 → -26419 → -26418

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 29 × 911

Divisors: 1, 29, 911, 26419

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110011100110011

Octal: -63463

Duodecimal: -13357

Hexadecimal: -6733

Square: 697963561

Square Root: 162.53922603482522

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

Pseudoprimes to base 7. A5938

The least number s > 1 having exactly n fives in the periodic part of the continued fraction of sqrt(s). A206585

If B is a collection in which there are C(n-1) [Catalan numbers, A000108] things with n points, a(n) is the number of subsets without repetition of B with a total of n points. A52805

a(n) = (2·n³ + 5·n² - 5·n)/2. A162265

Strong pseudoprimes to base 49. A20275

Numbers n such that 6·10ⁿ + 5·R_n - 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n. A103038

G.f.: A(x) = exp( ∑_n>=1 σ(n)*|A002129(n)|*xⁿ/n ). A162420

Number of (4+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250733

Write n-th prime in binary, then increase each run of 0's by one 0, and increase each run of 1's by one 1. a(n) is the decimal equivalent of the result. A319406