Properties of the Number -26019

Twenty-Six Thousand Nineteen

Basics

Value: -26020 → -26019 → -26018

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 ² × 59

Divisors: 1, 3, 7, 9, 21, 49, 59, 63, 147, 177

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110010110100011

Octal: -62643

Duodecimal: -13083

Hexadecimal: -65a3

Square: 676988361

Square Root: 161.30406070524077

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

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 1. A50043

a(1)=1, a(2)=2, a(3)=3; for n >= 3, a(n) is smallest number such that all a(i) for 1 <= i <= n are distinct, all a(i)+a(j) for 1 <= i < j <= n are distinct and all a(i)+a(j)+a(k) for 1 <= i < j < k <= n are distinct. A36241

Number of vertices in regular n-gon after 2 generations of mitosis. A349967

Numbers·such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of σ(x) and all cyclic permutations of Euler totient function φ(x). A247317

Number of partitions of n plus number of divisors of n. A195364

a(n) = number of isogeny classes of abelian surfaces over the finite field of order prime(n). A362198

Numbers n such that n | 10ⁿ + 9ⁿ + 8ⁿ + 7ⁿ + 6ⁿ + 5ⁿ + 4ⁿ + 3ⁿ + 2ⁿ. A57287