Properties of the Number 26775

Twenty-Six Thousand Seven Hundred Seventy-Five

Basics

Value: 26774 → 26775 → 26776

Parity: odd

Prime: No

Previous Prime: 26759

Next Prime: 26777

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 ² × 7 × 17

Divisors: 1, 3, 5, 7, 9, 15, 17, 21, 25, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100010010111

Octal: 64227

Duodecimal: 135B3

Hexadecimal: 6897

Square: 716900625

Square Root: 163.63068171953572

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

Hexagonal pyramidal numbers, or greengrocer's numbers. A2412

Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)). A124324

Records for minima of the positive distance d between the seventh power of a positive integer·and the square of an integer y such that d = x⁷ - y² (x <> k² and y <> k⁷). A179784

Triangle read by rows, T(n, k) = ∑_j=0..n C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and 0 <= k <= n. A112493

a(1) = 1, a(n+1) is the sum of a(n) and floor( arithmetic mean of a(1) ... a(n) ). A65094

a(n) is the maximal permanent of an n X n Hermitian Toeplitz matrix using all the integers 1, 2, ..., n and with all off-diagonal elements purely imaginary. A359617

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles of length >=2 (0<=k<= n/2). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... . A186757

Smallest number having exactly n divisors of the form 8·k + 7. A188226

Odd recursive abundant numbers: odd numbers k such that A333926(k) > 2·k. A333950

a(n) are the denominators corresponding to A372422(n). A372423