Properties of the Number 25395

Twenty-Five Thousand Three Hundred Ninety-Five

Basics

Value: 25394 → 25395 → 25396

Parity: odd

Prime: No

Previous Prime: 25391

Next Prime: 25409

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 1693

Divisors: 1, 3, 5, 15, 1693, 5079, 8465, 25395

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001100110011

Octal: 61463

Duodecimal: 12843

Hexadecimal: 6333

Square: 644906025

Square Root: 159.35808733791956

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

Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n). A81720

Number of bracelets (turnover necklaces) with n beads of 5 colors. A32276

Number of ways to color the vertices of an octagon using <= n colors, allowing rotations and reflections. A60560

Triangle read by rows: T(n,k) = number of collections of up to k subsets of [n] covering [n], with [0]={}; n>=0, k=0..2ⁿ. A381683

Records in A175046. A319422

Number of n-bead necklaces of 6 colors allowing reversal, with no adjacent beads having the same color. A208542

a(n) = a(n-1) + 16·a(n-3) - 16·a(n-4), where a(0) = 1, a(1) = 4, a(2) = 7, a(3) = 19. A297556

n·Lucas(n) - (n - 1) * Lucas(n - 1). A246715

Write n-th prime in binary, then increase each run of 0's by one 0, and increase each run of 1's by one 1. a(n) is the decimal equivalent of the result. A319406

T(n,k) = Number of n-bead necklaces of k colors allowing reversal, with no adjacent beads having the same color. A208544