Properties of the Number 32229

Thirty-Two Thousand Two Hundred Twenty-Nine

Basics

Value: 32228 → 32229 → 32230

Parity: odd

Prime: No

Previous Prime: 32213

Next Prime: 32233

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 3581

Divisors: 1, 3, 9, 3581, 10743, 32229

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111110111100101

Octal: 76745

Duodecimal: 16799

Hexadecimal: 7de5

Square: 1038708441

Square Root: 179.52437160452615

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

Number of Golomb rulers of length n. A169942

Least k such that decimal representation of k·n contains only digits 0 and 9. A96688

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nXk array. A219471

Odd composites k such that σ(k) has the same powerful part as k, where σ is the sum of divisors function. A386425

Composite numbers for which A324644(n)/A324198(n) = 2 and σ(n) == 2 (mod 4). A371082

Terms k of A228058 such that gcd(k - A048250(k), A162296(k) - k) = A162296(k) - k. A325376

Number of nX3 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX3 array. A219466

Smallest numbers k such that 2^k-1 when written in ternary contains its least significant zero in position n. A391268

Numbers k such that 7·5^k + 2 is a prime. A83092

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (1, -1, 0), (1, 0, 1), (1, 1, -1)}. A149006