Properties of the Number 60469

Sixty Thousand Four Hundred Sixty-Nine

Basics

Value: 60468 → 60469 → 60470

Parity: odd

Prime: No

Previous Prime: 60457

Next Prime: 60493

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 17 × 3557

Divisors: 1, 17, 3557, 60469

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110110000110101

Octal: 166065

Duodecimal: 2ABB1

Hexadecimal: ec35

Square: 3656499961

Square Root: 245.9044529893674

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

T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals. A202777

Number of inequivalent binary [ n,3 ] codes of dimension <= 3 without zero columns. A34337

Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UU and HH. A329666

G.f.: exp( ∑_n>=1 A322187(n)*xⁿ/n ), where A322187(n) is the coefficient of xⁿ*yⁿ/n in log( ∏_n>=1 1/(1 - x^2·n-1 - y^2·n-1) ). A322188

Number of (n+2)X6 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals. A202773

Number of (n+2)X8 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals. A202775

Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5). A39871

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (1, -1, 1), (1, 1, 0), (1, 1, 1)}. A150914

Smallest positive a(n) such that number of solutions to a(n) = a(j)+a(k) j<k<n is one or less. A60469

a(n) is the coefficient of xⁿ*yⁿ/n in log( ∏_n>=1 1/(1 - x^2·n-1 - y^2·n-1) ), for n >= 1. A322187