Properties of the Number 25383

Twenty-Five Thousand Three Hundred Eighty-Three

Basics

Value: 25382 → 25383 → 25384

Parity: odd

Prime: No

Previous Prime: 25373

Next Prime: 25391

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 8461

Divisors: 1, 3, 8461, 25383

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001100100111

Octal: 61447

Duodecimal: 12833

Hexadecimal: 6327

Square: 644296689

Square Root: 159.32043183471478

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

a(n) = (n³)/2 + (3·n²)/2 + 3·n + 3. A127873

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 1 or 2, and rows and columns in increasing lexicographic order. A263506

Number of compositions of n having exactly seven fixed points. A240742

Indices of primes in A000219. A285216

Inverse Mobius transform of the superabundant numbers, A051731·A004394. A134672

G.f.: A(x) = exp( ∑_n>=1 sigma_n(2n)*xⁿ/n ), where sigma_n(2n) is the sum of the n-th powers of the divisors of 2·n. A156360

Number of (1+1) X (n+1) arrays of permutations of 0..n·2+1 filled by rows with each element moved a city block distance of 0 1 or 2, and rows and columns in increasing lexicographic order. A263507

Number of SiC polytypes that repeat after 2n layers. A11959

a(n) is the smallest k such that uphi(k·n) = uphi(k·n+1), or 0 if no such k exists. A291530

Odd abundant numbers whose abundance is odd. A156942