Properties of the Number 25533

Twenty-Five Thousand Five Hundred Thirty-Three

Basics

Value: 25532 → 25533 → 25534

Parity: odd

Prime: No

Previous Prime: 25523

Next Prime: 25537

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 2837

Divisors: 1, 3, 9, 2837, 8511, 25533

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001110111101

Octal: 61675

Duodecimal: 12939

Hexadecimal: 63bd

Square: 651934089

Square Root: 159.7904878270293

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) = Hilltop maps: number of n X k binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 n X k array. A218663

Structured hexagonal diamond numbers (vertex structure 5). A100178

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order. A210095

Positions of squares in A276573. A277014

Number of vertices in a complete bipartite graph where the n vertices of each part are placed on the vertices, and on opposite sides, of a regular 2n-gon. A392971

Hilltop maps: number of n X 3 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 n X 3 array. A218658

Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..1 nX5 array. A218660

Number of sets of exactly seven positive integers <= n having a square element sum. A281867

Number of (n+1) X 2 0..2 arrays containing all values 0..2 with every 2 X 2 subblock having one or two distinct values, and new values 0..2 introduced in row major order. A210088

Number of (n+1)X7 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order. A210093