Properties of the Number 46232

Forty-Six Thousand Two Hundred Thirty-Two

Basics

Value: 46231 → 46232 → 46233

Parity: even

Prime: No

Previous Prime: 46229

Next Prime: 46237

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 5779

Divisors: 1, 2, 4, 8, 5779, 11558, 23116, 46232

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011010010011000

Octal: 132230

Duodecimal: 22908

Hexadecimal: b498

Square: 2137397824

Square Root: 215.01627845351618

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

Triangular array generated by its row sums: T(n,0)=1 for n >= 1, T(n,1)=r(n-1), T(n,k)=T(n,k-1)+r(n-k) for k=2,3,...,n, n >= 2, r(h)=sum of the numbers in row h of T. A54115

T(n,n-1), array T as in A054115. A54116

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n with k cells in the first column. (A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column). A100822

Triangle read by rows, T(n,k) = ∑_j=k..n j!, 0 <= k <= n. A143122

Array read by antidiagonals: T(m,n) = Sum( n <= i <= m+n-1 ) i!. A211370

a(n) = a(n-1) + a(n-2) - a(n-4) starting a(0)=0, a(1)=1, a(2)=a(3)=3. A168637

Numbers n such that n divides ∑_m=1..n (m+1)!. A100083

Cubes which are palindromes in base 4. A46232