Properties of the Number 4460

Four Thousand Four Hundred Sixty

Basics

Value: 4459 → 4460 → 4461

Parity: even

Prime: No

Previous Prime: 4457

Next Prime: 4463

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 223

Divisors: 1, 2, 4, 5, 10, 20, 223, 446, 892, 1115

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000101101100

Octal: 10554

Duodecimal: 26B8

Hexadecimal: 116c

Square: 19891600

Square Root: 66.783231428256

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

Number of n-celled free polyominoes without holes. A104

Numbers n such that Bernoulli number B_n has denominator 330. A272183

Number of binary sequences of length n with no initial repeats (or, with no final repeats). A122536

Number of ways to place n² nonattacking kings on a 2n X 2n cylindrical chessboard. A137432

Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^n-1 starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words·and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1. A93371

Maximal entry in row n of triangle in A169950. A169954

Triangular array read by rows: T(n,k) is the number of rooted identity trees with n nodes having exactly k subtrees from the root. A227774

Irregular triangle read by rows: T(n,k) is the number of degree-n permutations without overlaps which furnish k new permutations without overlaps upon the addition of an (n+1)st element, 2 <= k <= 1 + floor(n/2). A259689

Number of subsets of {1..n} containing n such that some element can be written as a positive linear combination of the others. A365042

a(n) = T(n,n-5), array T as in A055801. A55805