Properties of the Number 25953

Twenty-Five Thousand Nine Hundred Fifty-Three

Basics

Value: 25952 → 25953 → 25954

Parity: odd

Prime: No

Previous Prime: 25951

Next Prime: 25969

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 41 × 211

Divisors: 1, 3, 41, 123, 211, 633, 8651, 25953

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110010101100001

Octal: 62541

Duodecimal: 13029

Hexadecimal: 6561

Square: 673558209

Square Root: 161.09934822959403

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 X k 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303182

Triangular polyominoes (n-iamonds) without bilateral symmetry (holes are allowed). A30224

The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r. A5576

T(n,k)=Number of nXk 0..2 arrays with every row having the same least squares slope fit to a straight line, and every column the same least squares slope fit to a straight line, with a single point array taken as having zero slope. A223022

E.g.f.: sec(x)³+(sec(x)²*tan(x)). A225688

A(n, k) = (m·k)! [x^k] MittagLefflerE(m, x)^-n, for m = 2, n >= 0, k >= 0; square array read by descending antidiagonals. A326327

a(n) = 2·a(n-1) - a(n-3) + a(ceiling(n/2)), where a(0) = 1, a(1) = 1, a(2) = 1. A298404

arcsinh(arcsinh(x)+tan(x))=2·x-7/3!*x³+273/5!*x⁵-25953/7!*x⁷... A13097

Integer part of log(nⁿ)^{1 + log(1 + log(n})). A62449

Nearest integer to log(nⁿ)^{1 + log(1 + log(n})). A62450