Properties of the Number 26479

Twenty-Six Thousand Four Hundred Seventy-Nine

Basics

Value: 26478 → 26479 → 26480

Parity: odd

Prime: Yes

Previous Prime: 26459

Next Prime: 26489

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 26479

Divisors: 1, 26479

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110011101101111

Octal: 63557

Duodecimal: 133A7

Hexadecimal: 676f

Square: 701137441

Square Root: 162.72369219016633

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

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 3 + 2·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2·x - x². A367300

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2. A214510

Primes that remain prime through 4 iterations of function f(x) = 9x + 10. A23327

Primes p such that p and p² have same digit sum. A58370

Prime(n) and prime(n+2) use the same digits. A69794

Triangle of coefficients of polynomials v(n,x) jointly generated with A210741; see the Formula section. A210742

For 1<=x<=n, 1<=y<=n, with gcd(x,y)=1, write 1 = gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of u²+v². A345431

Number of extreme n-breakable vectors. A141348

Primes of the form 2·n² + 42·n + 19. A221903

Primes p with prime(p)³ + 2·p³ and p³ + 2·prime(p)³ both prime. A236574