Properties of the Number 26759

Twenty-Six Thousand Seven Hundred Fifty-Nine

Basics

Value: 26758 → 26759 → 26760

Parity: odd

Prime: Yes

Previous Prime: 26737

Next Prime: 26777

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 26759

Divisors: 1, 26759

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110100010000111

Octal: 64207

Duodecimal: 1359B

Hexadecimal: 6887

Square: 716044081

Square Root: 163.5817838269286

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

Numbers that are the sum of 9 nonzero 8th powers. A3387

T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms. A254698

Least prime in A031936 (lesser of 18-twins) whose distance to the next 18-twin is 2·n. A52358

Weighted count of partitions with distinct parts. A5895

For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) for any of these points; a(n) = minimum M(L) over all lines with C(L) = n, or -1 if there is no such line. A376187

For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n. A376188

a(n) is the number of multisets of n positive decimal digits where the sum of the digits equals the product of the prime digits. A384505

a(1) = 2, a(2) = 3 and a(n) = the smallest prime which is a linear combination of all previous terms with all coefficients >= 1. A72537

Numbers m which satisfy the equation: (m - floor((m - k)/k)) mod k = 1 (1 <= k <= m) only for k = 2 and m - 1. A378275

Primes p that have exactly three primitive roots that are not primitive roots mod p². A60519