Properties of the Number 26505

Twenty-Six Thousand Five Hundred Five

Basics

Value: 26504 → 26505 → 26506

Parity: odd

Prime: No

Previous Prime: 26501

Next Prime: 26513

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 19 × 31

Divisors: 1, 3, 5, 9, 15, 19, 31, 45, 57, 93

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110011110001001

Octal: 63611

Duodecimal: 13409

Hexadecimal: 6789

Square: 702515025

Square Root: 162.80356261458164

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

Sum of 10 nonzero 8th powers. A3388

a(1) = 1; for n > 1, a(n) = n·a(n-1) if n is a prime, otherwise a(n) = floor(a(n-1)/A020639(n)), where A020639(n) is the smallest prime divisor of n. A330252

Number of (w,x,y,z) with all terms in {1,...,n} and w > x < y >= z. A212501

Least positive integer m such that m·n divides σ(m²+n²), where σ(k) is the sum of all positive divisors of k. A248189

∏_n>=1 (1 + xⁿ)^a(n) = g.f. of A001970 (partitions of partitions). A305841

a(n) = n(n+7)(n+1)(n²+2n+12)/120. A51746

a(n) = ((2^b-1)/φ(n))*∑_d∣n Moebius(n/d)*d^b-1 for b = 4. A160892

a(n) = binomial(n,2)*(binomial(n-1,2) + 2). A352405

a(n) is the smallest number k with exactly n of its divisors in A052294. A363463

Number of nX5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically. A207658