ℕ atory
Play Now

Properties of the Number 6472

Six Thousand Four Hundred Seventy-Two

Basics

Value: 6471 → 6472 → 6473

Parity: even

Prime: No

Previous Prime: 6469

Next Prime: 6473

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 3 × 809

Divisors: 1, 2, 4, 8, 809, 1618, 3236, 6472

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1100101001000

Octal: 14510

Duodecimal: 38B4

Hexadecimal: 1948

Square: 41886784

Square Root: 80.44874144447506

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

Partial sums of A299257. A299263
Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=2, 0<=k<=floor(n/2)2, read by rows. A236679
T(n,k) = Number of n X k 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing. A224146
Numbers n such that prime(n) == -3 (mod n). A92045
a(n) is the largest number m such that m = π(n·m). A102281
T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly two elements. A282838
Number of non-equivalent ways to place 7 non-attacking kings on an n X n board. A279116
T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one king-move neighbor, with new values introduced in row major 0..2 order. A223033
Increasing gaps among twin primes: size. A36063
Irregular table read by rows: T(n,k) is the number of k-sided polygons formed, for k>=3, in a square when straight line segments connect the n+1 points along each edge that divide it into n equal parts to the n+1 points on the edge on the opposite side of the square. A355841