Properties of the Number 15466

Fifteen Thousand Four Hundred Sixty-Six

Basics

Value: 15465 → 15466 → 15467

Parity: even

Prime: No

Previous Prime: 15461

Next Prime: 15467

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 11 × 19 × 37

Divisors: 1, 2, 11, 19, 22, 37, 38, 74, 209, 407

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11110001101010

Octal: 36152

Duodecimal: 8B4A

Hexadecimal: 3c6a

Square: 239197156

Square Root: 124.36237373096414

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

Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of ∑_i=1..n r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}. A70893

Truncated square pyramid numbers: a(n) = ∑_{k = n..2·n-1} k². A50410

Number of non-isomorphic twice-balanced multiset partitions of weight n. A340652

Irregular triangle read by rows: T(n,k) is the number of sensed 3-connected planar maps with n >= 4 faces and k >= 4 vertices. A239893

a(n) = first term that can be reduced in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n), such that b is always 6 so that each interpretation is base 7. Terms already fully reduced (i.e., single digits) are excluded. A141840

Array read by antidiagonals: T(n,k) is the number of noncrossing k-gonal cacti with n polygons up to rotation. A361236

Coefficient of q^2n-1 in the series expansion of Ramanujan's mock θ function f(q). A199

a(n) = ∑_{k=0..floor(n/2)} (n-k)². A129371

a(n) is the number of symmetric permutations (p(1),p(2),...,p(m)) of (1,2,...,m), m=2n or m=2n+1, with p(m+1-k) = m+1-p(k) for 1<=k<=m, such that adjacent numbers do not differ by 1. a(n) is also the number of point-symmetric arrangements of m non-attacking kings on an m X m board, with one in each row and column. A283184

Number of nonequivalent noncrossing triangular cacti with n triangles up to rotation. A361237