Properties of the Number 26795

Twenty-Six Thousand Seven Hundred Ninety-Five

Basics

Value: 26794 → 26795 → 26796

Parity: odd

Prime: No

Previous Prime: 26783

Next Prime: 26801

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 5 × 23 × 233

Divisors: 1, 5, 23, 115, 233, 1165, 5359, 26795

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100010101011

Octal: 64253

Duodecimal: 1360B

Hexadecimal: 68ab

Square: 717972025

Square Root: 163.6917835445628

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

Composite numbers k coprime to 13 such that k divides A006190(k-Kronecker(13,k)). A327653

Smallest number whose representation requires n triangular numbers with greedy algorithm; also number of 1-2 rooted trees of height n. A6893

Numbers k such that 2^k+1 == 1 (mod k). A187787

A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of three complementary pairs of simple musical tones: 7/6 and 12/7, 6/5 and 5/3 and 7/5 and 10/7. A60529

Number of partitions of {1...n} containing 2 strings of 3 consecutive integers, where each string is counted within a block and a string of more than 3 consecutive integers are counted three at a time. A105484

a(n) = ∑_j=1..n ∑_k=1..n φ(j·k). A372633

Numbers k such that 2·k+1, 3·k+2, 4·k+3 and 5·k+4 are primes. A138700

Composite numbers k coprime to 8 such that k divides Pell(k - Kronecker(8,k)), Pell = A000129. A327651

n·10²-1, n·10²-3, n·10²-7 and n·10²-9 are all prime. A64976

Combinatorial triangle !n. This table read by rows gives the coefficients of general sum formulas of n-th left factorials (A003422). The k-th row (k>=1) contains T(i,k) for i=1 to 2·k and k=1 to n-2, where T(i,k) satisfies !n = n + ∑_k=1..n-2 ∑_i=1..2·k T(i,k) * C(n-k-1,i). A102639