Properties of the Number 63090

Sixty-Three Thousand Ninety

Basics

Value: 63089 → 63090 → 63091

Parity: even

Prime: No

Previous Prime: 63079

Next Prime: 63097

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 701

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011001110010

Octal: 173162

Duodecimal: 30616

Hexadecimal: f672

Square: 3980348100

Square Root: 251.17722826721374

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 + 1)*(20·n² + 19·n + 6)/6. A220084

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that min(x(i) - x(i-1)) < number of distinct parts of p. A241823

Alkane (or paraffin) numbers l(11,n). A18212

Number of bracelets (turn over necklaces) with n beads: 1 blue, 12 green, and r = n - 13 red. A141783

Number of n-element subsets of [n+8] having an even sum. A282084

Maximum over 0 <= k <= n/2 of the number of permutations of two symbols occurring k and n-2·k times, respectively, where a permutation and its reversal are counted only once. A362260

a(n) = number of solutions (x₁, x₂, ..., x_n) to ∏_i=1..n (1 + 1/x_i) = any integer. A376012

Numbers n such that A118799(n) = 0. A118578

a(n)/(n·n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order. A63090

A triangle of matrix polynomials: m(n)=antisymmeticmatix(n).Transpose[antisymmeticmatix(n)]. A158335