Properties of the Number 32822

Thirty-Two Thousand Eight Hundred Twenty-Two

Basics

Value: 32821 → 32822 → 32823

Parity: even

Prime: No

Previous Prime: 32803

Next Prime: 32831

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 16411

Divisors: 1, 2, 16411, 32822

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000000110110

Octal: 100066

Duodecimal: 16BB2

Hexadecimal: 8036

Square: 1077283684

Square Root: 181.1684299208888

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 A253088. A255048

a(n) = prime(1³) + prime(2³) + prime(3³) + ... + prime(n³). A109789

Coefficient of xⁿ in the expansion of ( (1-x+x³) / (1-x) )^2·n. A372416

Least integer m whose largest prime factor > m^n/(n+1). A63765

Irregular triangle T(n,k) = 2^floor(n/3-k) * nextprime(2^{n-2*(floor(n/3}-k))), with k = 0..floor(n/3)-1. A384875

Number of nonnegative solutions to x² + y² + z² < n². A218711

Numbers whose set of base-10 digits is {1,4}. A32822

Number of (n+1)X(2+1) 0..2 arrays with the upper median of every 2X2 subblock equal. A237302

Smallest exponent m of n such that A289280(n) | n^m. A316990

Array read by downward antidiagonals: T(n,k) is the number of partitions of [n], n >= 1, k >= 1, into sets labeled with positive integers, such that the labels sum to k. A387299