Properties of the Number 75264

Seventy-Five Thousand Two Hundred Sixty-Four

Basics

Value: 75263 → 75264 → 75265

Parity: even

Prime: No

Previous Prime: 75253

Next Prime: 75269

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁹ × 3 × 7 ²

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010011000000000

Octal: 223000

Duodecimal: 37680

Hexadecimal: 12600

Square: 5664669696

Square Root: 274.34285119171597

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 nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A239599

Arithmetic derivative of cubes: a(n) = 3·n²*A003415(n). A68721

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 49", based on the 5-celled von Neumann neighborhood. A278469

Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1). A86915

Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps. A114655

Conjectured list of fully multisociable numbers. A183029

Numbers k such that A000005(k) = A000688(k). A369168

a(n) = pos(M(n)), where M(n) is the n X n circulant matrix with (row 1) = (F(2), F(3), ..., F(n+1)), where F = A000045 (Fibonacci numbers), and pos(M(n)) is the positive part of the determinant of M(n); see A380661. A384596

B-trees of order 5 with n labeled leaves. A58521

Triangle read by rows: T(n,k) is the coefficient of (1+x)^k in the ZZ polynomial of the hexagonal graphene flake O(3,3,n). A338217