Properties of the Number -26199

Twenty-Six Thousand One Hundred Ninety-Nine

Basics

Value: -26200 → -26199 → -26198

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 41 × 71

Divisors: 1, 3, 9, 41, 71, 123, 213, 369, 639, 2911

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110011001010111

Octal: -63127

Duodecimal: -131B3

Hexadecimal: -6657

Square: 686387601

Square Root: 161.86105152259452

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

Sequence related to the Taylor expansion of the Jacobi theta₃ constant. A317651

Numbers k such that σ(k) = σ(k+7). A15867

Numbers k for which A354102(k) = A354102(σ(k)). A354106

Number of partitions of n with even number (or 0) 2's. A92295

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 158", based on the 5-celled von Neumann neighborhood. A279475

Consecutive states of the linear congruential pseudo-random number generator 171·s mod 30269 when started at s=1. A385031

a(n) = ceiling((n + 7/10)³). A34133

a(n) = n·A052530(n)/2. A207836

Sum of products of squares of parts , counted without multiplicity, in all partitions of n. A369887

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 1, 1), (1, 0, 1), (1, 1, -1), (1, 1, 0)}. A151200