Properties of the Number 26939

Twenty-Six Thousand Nine Hundred Thirty-Nine

Basics

Value: 26938 → 26939 → 26940

Parity: odd

Prime: No

Previous Prime: 26927

Next Prime: 26947

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 11 × 31 × 79

Divisors: 1, 11, 31, 79, 341, 869, 2449, 26939

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100100111011

Octal: 64473

Duodecimal: 1370B

Hexadecimal: 693b

Square: 725709721

Square Root: 164.13104520473877

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

Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of parts > 1) is a part. A241512

Numbers n such that p1=2n+3, p2=4n+5, p3=6n+7 and p4=8n+9 are all prime. A105653

Expansion of e.g.f. exp( (sin(x) + x·cos(x))/2 ). A349103

Expansion of ∑_1<=i<=j q^i+j/( (1-qⁱ)*(1-q^j) )². A374929

a(n) = 29 + 73·n + 37·n². A145980

a(n) = (n + 2)*(n² + n - 1). A318765

Numbers equal to the sum of the aliquot parts of the previous k numbers, for some k. A320021

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, -1), (1, 0, 0), (1, 0, 1)}. A150394

Version 1 of the "previous prime" function: largest prime <= n. A7917

Self-convolution of array T given by A026300. A26939