Properties of the Number 13500

Thirteen Thousand Five Hundred

Basics

Value: 13499 → 13500 → 13501

Parity: even

Prime: No

Previous Prime: 13499

Next Prime: 13513

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 5 ³

Divisors: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11010010111100

Octal: 32274

Duodecimal: 7990

Hexadecimal: 34bc

Square: 182250000

Square Root: 116.1895003862225

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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) = (1/2)*(n³ + n*(n mod 2)). A317614

Irregular triangle read by rows: T(n,k) (0 <= k <= n²) are coefficients of cluster density function for site percolation on an n X n 2D triangular lattice with periodic boundary conditions. A365940

Smaller member of an infinitary amicable pair. A126169

a(n) = 4·n³. A33430

T(n,k)=Number of length n+5 0..k arrays with no three disjoint pairs in any consecutive six terms having the same sum. A248448

Powerful numbers divisible by cubes of 2 distinct primes. A376936

Sum of digits of numbers between 0 and (10ⁿ)-1. A34967

T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order. A267667

Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=8. A135193

Powerful numbers k that have a primorial kernel and more than 1 distinct prime factor. A369374