Properties of the Number 26995

Twenty-Six Thousand Nine Hundred Ninety-Five

Basics

Value: 26994 → 26995 → 26996

Parity: odd

Prime: No

Previous Prime: 26993

Next Prime: 27011

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 5 × 5399

Divisors: 1, 5, 5399, 26995

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100101110011

Octal: 64563

Duodecimal: 13757

Hexadecimal: 6973

Square: 728730025

Square Root: 164.30155203162263

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 ways to write n as an orderless product of orderless sums. A318949

Number of ways to choose an integer partition of each factor in a factorization of n. A318948

Numerators of values T(m,m) of urn game described in A108885 and A108886. A108883

Main diagonal of A332372. A332373

Number of (n+2) X 4 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock. A186561

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock. A186568

Array read by antidiagonals: T(d,k) (k >= 1, d = 1,2,3,4,5,6,...) = smallest semiprime s of k (not necessarily consecutive) semiprimes in arithmetic progression with common difference d, or 0 if there is no such arithmetic progression. A124570

a(n) = ∑_k=0..n (k+1) * A026692(n, k). A26995