Properties of the Number 15630

Fifteen Thousand Six Hundred Thirty

Basics

Value: 15629 → 15630 → 15631

Parity: even

Prime: No

Previous Prime: 15629

Next Prime: 15641

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 521

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 521, 1042

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110100001110

Octal: 36416

Duodecimal: 9066

Hexadecimal: 3d0e

Square: 244296900

Square Root: 125.01999840025594

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) = floor(n*φ¹³), where φ is the golden ratio, A001622. A4928

Coefficients in q-expansion of (E₄² - E₂*E₆)/1008, where E₂, E₄, E₆ are the Eisenstein series shown in A006352, A004009, A013973, respectively. A282050

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by one or less. A269606

Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of interchanges in reversal step. A79756

Sums of two powers of 5. A55237

Starts of runs of 3 consecutive Catalan-Niven numbers (A352508). A352510

Starts of runs of 4 consecutive Catalan-Niven numbers (A352508). A352511

a(n) = n³ + 5. A84381

Array read by antidiagonals: a(n,k) = number of k-colorings of a circle of n nodes (n >= 1, k >= 1). A106512

a(n) = 5ⁿ + 5. A178676