Properties of the Number 47622

Forty-Seven Thousand Six Hundred Twenty-Two

Basics

Value: 47621 → 47622 → 47623

Parity: even

Prime: No

Previous Prime: 47609

Next Prime: 47623

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7937

Divisors: 1, 2, 3, 6, 7937, 15874, 23811, 47622

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101000000110

Octal: 135006

Duodecimal: 23686

Hexadecimal: ba06

Square: 2267854884

Square Root: 218.22465488573926

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

Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions. A2464

Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1. A1100

Number T(n,k) of permutations p of [n] such that |p(i+k) - p(i)| <> k for i in [n-k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A333706

Triangle read by rows: T(n,k) is the number of ways to place k non-attacking kings in each row and column of an n X n board, 0 <= k <= floor(n/4) + [n=1]. A387098

Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] without consecutive adjacent values. A338526

a(n) = [xⁿ] (1 + x*(1+x)ⁿ⁺¹ )ⁿ. A121675

Triangle: Number of asymmetric semigroups of order n with k idempotents. A58113

Triangle read by rows: T(n,k) gives the number of permutations of length n containing exactly k instances of the 1-box pattern; 0 <= k <= n. A346462

Numbers n with property that n² is a sum of some 120 successive primes. A166262

Triangle read by rows: T(n, k) is the number of permutations of length n, which contain the maximum number of distinct patterns of length k. A373877