ℕ atory
Play Now

Properties of the Number 26794

Twenty-Six Thousand Seven Hundred Ninety-Four

Basics

Value: 26793 → 26794 → 26795

Parity: even

Prime: No

Previous Prime: 26783

Next Prime: 26801

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 13397

Divisors: 1, 2, 13397, 26794

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 110100010101010

Octal: 64252

Duodecimal: 1360A

Hexadecimal: 68aa

Square: 717918436

Square Root: 163.68872899500442

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1. A234161
First of two complementary trees generated by the triangular numbers. The second tree is A183232. A183231
Shifts left under Weigh transform. A38073
Number of asymmetric mobiles (circular rooted trees) with n nodes and 3 leaves. A55364
Sum of the largest parts in the partitions of 3n into 3 parts. A236370
Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock having the absolute values of all six edge and diagonal differences no larger than 1. A234154
Number of (n+1)X(5+1) 0..3 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1. A234158
Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 21. A31609
Triangular array T read by rows: T(n,k) = number of partitions of n in which least part is k, 1<=k<=n. A26794
Numbers k such that b(k) < b(j) for all j < k where b(k) = Minsqrt(n) - ∑i sqrt(ci) > 0 with ci being unique integers. A337211