Properties of the Number 27480

Twenty-Seven Thousand Four Hundred Eighty

Basics

Value: 27479 → 27480 → 27481

Parity: even

Prime: No

Previous Prime: 27479

Next Prime: 27481

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 229

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110101101011000

Octal: 65530

Duodecimal: 13AA0

Hexadecimal: 6b58

Square: 755150400

Square Root: 165.7709262808168

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 of succession numbers for circular permutations. A134832

Number of regions formed by infinite lines when connecting all vertices and all points that divide the sides of an equilateral triangle into n equal parts. A343755

Array read by antidiagonals: T(m,n) is the number of (undirected) paths in the complete bipartite graph K_m,n. A360850

Number of rooted trees with 3 nodes of disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children. A5173

E.g.f.: logarithm of G(x)/x where G(x) = ... x·exp(x⁴) o x·exp(x³) o x·exp(x²) o x·exp(x), a composition of functions x·exp(xⁿ) for n = 1,2,3,... A277182

Number of 5-cycles in the n-triangular honeycomb obtuse knight graph. A290391

Expansion of ∑_k>=1 k³ * x^k/(1 - x^k)³. A366135

Fourth column (k=3) of triangle A134832 (circular succession numbers). A135801

Triangle, read by rows, T(n,k) = binomial(n+k+1, n+1) * ∑_j=0..k j!*binomial(n,j)*binomial(k, j). A176121

Number of (undirected) paths in the complete bipartite graph K_m,n (triangle read by rows with m = 1..n and n = 1..). A307027