Properties of the Number 3235

Three Thousand Two Hundred Thirty-Five

Basics

Value: 3234 → 3235 → 3236

Parity: odd

Prime: No

Previous Prime: 3229

Next Prime: 3251

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 647

Divisors: 1, 5, 647, 3235

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110010100011

Octal: 6243

Duodecimal: 1A57

Hexadecimal: ca3

Square: 10465225

Square Root: 56.87706040223949

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

Second spoke of a hexagonal spiral. A56106

Expansion of (1 + 10·x + 20·x² + 10·x³ + x⁴)/(1-x)⁵. A160747

Numbers n such that 3ⁿ + 2^n-1 is prime. A82103

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 8 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 8. A252615

a(n) = ceiling(∑_i=1..n-1 a(i)/4) for n >= 2 starting with a(1) = 1. A120160

a(n) = 2·n² + n - 5. A100040

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 3. A50051

Smallest value of·such that M(x) = n, where M() is Mertens's function A002321. A51400

Table T(n,k) by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary words (n,k >= 1) with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet. A143327

Centered 14-gonal numbers. A69127